Parallelizable Search-Space Decomposition for Large-Scale Combinatorial Optimization Problems Using Ising Machines

Eiji Kawase, Shuta Kikuchi, Hideaki Tamai +1

Combinatorial optimization problems are crucial in industry. However, many COPs are NP-hard, causing the search space to grow exponentially with problem size and rendering large-sc…