Optimization algorithms for the disjunctively constrained knapsack problem
- 140 Downloads
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.
KeywordsKnapsack problem Disjunctive constraints Polytope Facet Separation Branch-and-cut
We would like to thank the referees for their valuable comments which helped to improve the presentation of the paper.
Compliance with ethical standards
Conflict of interest
Mariem Ben Salem declares that she has no conflict of interest. Dr. Raouia Taktak declares that she has no conflict of interest. Prof. Dr. A. Ridha Mahjoub declares that he has no conflict of interest. Prof. Dr. Hanêne Ben-Abdallah declares that she has no conflict of interest.
Human and animal rights
This article does not contain any studies with human participants or animals performed by any of the authors.
- Atamtürk A, Narayanan V (2009) The submodular knapsack polytope. Discrete Optim 6(4):333–344Google Scholar
- Bettinelli A, Cacchiani V, Malaguti E (2014) Bounds and algorithms for the knapsack problem with conflict graph. Tech. rep., Technical Report OR-14-16, DEIS–University of Bologna, Bologna, ItalyGoogle Scholar
- Hifi M, Negre S, Mounir MQA (2009) Local branching-based algorithm for the disjunctively constrained knapsack problem. In: IEEE international conference on computers and industrial engineering, 2009. pp 279–284Google Scholar
- Hifi M, Negre S, Saadi T, Saleh S, Wu L (2014) A parallel large neighborhood search-based heuristic for the disjunctively constrained knapsack problem. In: IEEE international processing symposium workshops (IPDPSW) parallel and distributed, pp 1547–1551Google Scholar
- Hifi M, Otmani N (2011) A first level scatter search for disjunctively constrained knapsack problems. In: IEEE international conference on communications, computing and control applications (CCCA). pp 1–6Google Scholar
- Hifi M, Saleh S, Wu L, Chen J (2015) A hybrid guided neighborhood search for the disjunctively constrained knapsack problem. Cogent Eng 2(1):1068,969Google Scholar
- Kaparis K, Letchford AN (2010a) Cover inequalities. Wiley Encyclopedia of Operations Research and Management ScienceGoogle Scholar
- Mahjoub AR (2010) Polyhedral approaches. In: Paschos V (ed) Concepts of combinatorial optimization. ISTE-Wiely, pp 261–324Google Scholar
- Senisuka A, You B, Yamada T (2005) Reduction and exact algorithms for the disjunctively constrained knapsack problem. In: International symposium, operational research BremenGoogle Scholar
- Yamada T, Kataoka S, Watanabe K (2002) Heuristic and exact algorithms for the disjunctively constrained knapsack problem. Inform Proces Soc Jpn J 43(9)Google Scholar