A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts

Open Webpage

Stefano Coniglio, Fabio Furini, Pablo San Segundo

Published: 2021, Last Modified: 30 Sept 2024Eur. J. Oper. Res. 2021EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•A new efficient combinatorial branch and bound algorithm for solving the KPC is described.•Several bounding procedures based on different relaxations of the problem are described.•Extensive validation with publicly available benchmarks is reported.