A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
Lists
Only you see this
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.
BibTeX
@article{coniglio2021new,
author = {Stefano Coniglio and Fabio Furini and Pablo San Segundo},
title = {{A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts}},
journal = {Eur. J. Oper. Res.},
year = {2021},
url = {https://openreview.net/forum?id=sw3HkdAGgU},
}Loading related content...