An Ising Machine-Based Hybrid Optimization Method Using Constraint Conversion and Correction

This paper proposes an Ising machine-based hy-brid optimization method to solve combinatorial optimization problems, which consists of an approximate formulation process, an annealing process with an Ising machine, and a correction process. The approximate formulation and correction aim to improve the performance of the Ising machine. Computational experiments were conducted on the multi-dimensional knapsack problem (MKP) using an Ising machine. We compare the results with those of the proposed method and the conventional method and demonstrate the effectiveness of the proposed approach.