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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 289; H. 2; S. 435 - 455
Hauptverfasser:	Coniglio, Stefano, Furini, Fabio, San Segundo, Pablo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.03.2021
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!