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

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 289; no. 2; pp. 435 - 455
Main Authors:	Coniglio, Stefano, Furini, Fabio, San Segundo, Pablo
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.03.2021
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!