Optimization algorithms for the disjunctively constrained knapsack problem

Abstract

This paper deals with the Knapsack Problem with conflicts, also known as the Disjunctively Constrained Knapsack Problem. The conflicts are represented by a graph whose vertices are the items such that adjacent items cannot be packed in the knapsack simultaneously. We consider a classical formulation for the problem, study the polytope associated with this formulation and investigate the facial aspect of its basic constraints. We then present new families of valid inequalities and describe necessary and sufficient conditions for these inequalities to be facet defining. We also devise separation routines for these inequalities. Using these results, we develop a Branch-and-Cut algorithm for the problem. An extensive computational study is also presented.