Abstract: The Knapsack Problem (KP) continues to be widely used in academic examples and research nowadays. In this paper, we review the KP and compare different solvers based on Quantum Annealing (QA ...

Abstract: The Set-Union Knapsack Problem (SUKP) is a complex combinatorial optimization problem that extends the classic Knapsack with each item composed of several distinct weighted elements instead ...