The University of Southampton
University of Southampton Institutional Repository

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

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

We study the Knapsack Problem with Conflicts, a generalization of the Knapsack Problem in which a set of conflicts specifies pairs of items which cannot be simultaneously selected. In this work, we propose a novel combinatorial branch-and-bound algorithm for this problem based on an n-ary branching scheme. Our algorithm effectively combines different procedures for pruning the branch-and-bound nodes based on different relaxations of the Knapsack Problem with Conflicts. Its main elements of novelty are: (i) the adoption of the branching-and-pruned set branching scheme which, while extensively used in the maximum-clique literature, was never successfully employed for solving the Knapsack Problem with Conflicts; (ii) the adoption of the Multiple-Choice Knapsack Problem for the derivation of upper bounds used for pruning the branch-and-bound tree nodes; and (iii) the design of a new upper bound for the latter problem which can be computed very efficiently. Key to our algorithm is its high pruning potential and the low computational effort that it requires to process each branch-and-bound node. An extensive set of experiments carried out on the benchmark instances typically used in the literature shows that, for edge densities ranging from 0.1 to 0.9, our algorithm is faster by up to two orders of magnitude than the state-of-the-art method and by up to several orders of magnitude than a state-of-the-art mixed-integer linear programming solver.

Branch-and-bound algorithm, Combinatorial optimization, Knapsack Problem with Conflicts, Maximum Weighted Clique Problem
0377-2217
435-455
Coniglio, Stefano
03838248-2ce4-4dbc-a6f4-e010d6fdac67
Furini, Fabio
0bf78b98-3255-4fa0-aff7-699d8f8bb292
San Segundo, Pablo
f5b2796c-2a22-4fb0-93e0-83f873289830
Coniglio, Stefano
03838248-2ce4-4dbc-a6f4-e010d6fdac67
Furini, Fabio
0bf78b98-3255-4fa0-aff7-699d8f8bb292
San Segundo, Pablo
f5b2796c-2a22-4fb0-93e0-83f873289830

Coniglio, Stefano, Furini, Fabio and San Segundo, Pablo (2021) A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts. European Journal of Operational Research, 289 (2), 435-455. (doi:10.1016/j.ejor.2020.07.023).

Record type: Article

Abstract

We study the Knapsack Problem with Conflicts, a generalization of the Knapsack Problem in which a set of conflicts specifies pairs of items which cannot be simultaneously selected. In this work, we propose a novel combinatorial branch-and-bound algorithm for this problem based on an n-ary branching scheme. Our algorithm effectively combines different procedures for pruning the branch-and-bound nodes based on different relaxations of the Knapsack Problem with Conflicts. Its main elements of novelty are: (i) the adoption of the branching-and-pruned set branching scheme which, while extensively used in the maximum-clique literature, was never successfully employed for solving the Knapsack Problem with Conflicts; (ii) the adoption of the Multiple-Choice Knapsack Problem for the derivation of upper bounds used for pruning the branch-and-bound tree nodes; and (iii) the design of a new upper bound for the latter problem which can be computed very efficiently. Key to our algorithm is its high pruning potential and the low computational effort that it requires to process each branch-and-bound node. An extensive set of experiments carried out on the benchmark instances typically used in the literature shows that, for edge densities ranging from 0.1 to 0.9, our algorithm is faster by up to two orders of magnitude than the state-of-the-art method and by up to several orders of magnitude than a state-of-the-art mixed-integer linear programming solver.

This record has no associated files available for download.

More information

Accepted/In Press date: 15 July 2020
e-pub ahead of print date: 26 July 2020
Published date: 1 March 2021
Keywords: Branch-and-bound algorithm, Combinatorial optimization, Knapsack Problem with Conflicts, Maximum Weighted Clique Problem

Identifiers

Local EPrints ID: 445404
URI: http://eprints.soton.ac.uk/id/eprint/445404
ISSN: 0377-2217
PURE UUID: a3d5d624-c7c6-455a-8db7-3de1da0bf9a0
ORCID for Stefano Coniglio: ORCID iD orcid.org/0000-0001-9568-4385

Catalogue record

Date deposited: 07 Dec 2020 17:33
Last modified: 18 Mar 2024 03:34

Export record

Altmetrics

Contributors

Author: Fabio Furini
Author: Pablo San Segundo

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×