Those that solve artificially simplified problems where quantum advantage is meaningless. Those that provide no genuine quantum advantage when all costs are properly accounted for. This critique is ...

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 ...

Abstract: This paper proposes a multitask knapsack problem framework as a discrete test suite that allows for the independent adjustment of both objective and constraint similarities among tasks. The ...