14 citations · 23 across the 6 of their papers we have counts for
5 papers · 1 filter
Geometric Characteristics of Subproblems in Ising-Machine-Assisted Large Neighborhood Search
Masashi Yamashita, Shu Tanaka
Large-scale quadratic unconstrained binary optimization (QUBO) formulations of constrained combinatorial optimization problems often exceed the input-size limit of present Ising ma…
Evaluating the Performance of Direct Higher-Order Formulations in Combinatorial Optimization Problems
Kazuki Ikeuchi, Yoshiki Matsuda, Shu Tanaka
Ising machines, including quantum annealing machines, are promising next-generation computers for combinatorial optimization problems. However, due to hardware limitations, most Is…
Advantages of fixing spins in quantum annealing
Tomohiro Hattori, Hirotaka Irie, Tadashi Kadowaki +1
Quantum annealing can efficiently obtain solutions to combinatorial optimization problems. Size-reduction methods are used to treat large-scale combinatorial optimization problems…
Quick design of feasible tensor networks for constrained combinatorial optimization
Hyakka Nakada, Kotaro Tanahashi, Shu Tanaka
Quantum computers are expected to enable fast solving of large-scale combinatorial optimization problems. However, their limitations in fidelity and the number of qubits prevent th…
Annealing-Assisted Column Generation for Inequality-Constrained Combinatorial Optimization Problems
Hiroshi Kanai, Masashi Yamashita, Kotaro Tanahashi +1
Ising machines are expected to solve combinatorial optimization problems faster than the existing integer programming solvers. These problems, particularly those encountered in pra…