Translating Constraints into QUBOs for the Quadratic Knapsack Problem
conference paper
One of the first fields where quantum computing will likely show its use is optimisation. Many optimisation problems naturally arise in a quadratic manner, such as the quadratic knapsack problem. The current state of quantum computers requires these problems to be formulated as a quadratic unconstrained binary optimisation problem, or QUBO. Constrained quadratic binary optimisation can be translated into QUBOs by translating the constraint. However, this translation can be made in several ways, which can have a large impact on the performance when solving the QUBO. We show six different formulations for the quadratic knapsack problem and compare their performance using simulated annealing. The best performance is obtained by a formulation that uses no auxiliary variables for modelling the inequality constraint.
Topics
TNO Identifier
986169
Source title
ICCS 2023, International Conference on Computational Science, Prague, Czech Republic, 3-5 July 2023
Files
To receive the publication files, please send an e-mail request to TNO Repository.