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

•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. We study the Knapsack Problem with Conflicts, a ge...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 289; číslo 2; s. 435 - 455
Hlavní autori:	Coniglio, Stefano, Furini, Fabio, San Segundo, Pablo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.03.2021
Predmet:	Branch-and-bound algorithm Combinatorial optimization Knapsack Problem with Conflicts Maximum Weighted Clique Problem Knapsack Problem with Conflicts Combinatorial optimization Branch-and-bound algorithm Maximum Weighted Clique Problem
ISSN:	0377-2217, 1872-6860
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!