2 citations · 3 across the 8 of their papers we have counts for
5 papers · 1 filter
Ising-Machine-Assisted Large Neighborhood Search with Flexibly Tunable Subproblem Size
Koshiro Fujimoto, Masashi Yamashita, Shu Tanaka
Ising machines are heuristic solvers for combinatorial optimization, but their solution quality can degrade when large-scale constrained problems are solved directly. Ising-machine…
Extending Sample Persistence Variable Reduction for Constrained Combinatorial Optimization Problems
Shunta Ide, Shuta Kikuchi, Shu Tanaka
Constrained combinatorial optimization problems (CCOPs) are challenging to solve due to the exponential growth of the solution space. When tackled with Ising machines, constraints…
Effectiveness of cardinality-return weighted maximum independent set approach for financial portfolio optimization
Keita Takahashi, Tetsuro Abe, Yasuhito Nakamura +3
The portfolio optimization problem is a critical issue in asset management and has long been studied. Markowitz's mean-variance model has fundamental limitations, such as the assum…
Effectiveness of Hybrid Optimization Method for Quantum Annealing Machines
Shuta Kikuchi, Nozomu Togawa, Shu Tanaka
To enhance the performance of quantum annealing machines, several methods have been proposed to reduce the number of spins by fixing spin values through preprocessing. We proposed…
Performance of Domain-Wall Encoding in Digital Ising Machine
Shuta Kikuchi, Kotaro Takahashi, Shu Tanaka
To tackle combinatorial optimization problems using an Ising machine, the objective function and constraints must be mapped onto a quadratic unconstrained binary optimization (QUBO…