Benchmarking Ising Machines on the Quadratic Knapsack Problem with Efficient Post-processing

Ising machines can efficiently solve combinatorial optimization problems, but their performance on problems with additional constraints has been limited. This study proposes an effective post-processing method that combines repair and improvement procedures to enhance the solving performance of Ising machines on the quadratic knapsack problem.