The min-conflict packing problem

Abstract : In the classical bin-packing problem with conflicts (BPC), the goal is to minimize the number of bins used to pack a set of items subject to disjunction constraints. In this paper, we study a new version of BPC: the min-conflict packing problem (MCBP), in which we minimize the number of violated conflicts when the number of bins is fixed. In order to find a tradeoff between the number of bins used and the violation of the conflict constraints, we also consider a bi-objective version of this problem. We show that the special structure of its Pareto front allows to reformulate the problem as a small set of MCBP. We solved these two problems through heuristics, column-generation methods, and a tabu search. Computational experiments are reported to assess the quality of our methods.
Type de document :
Article dans une revue
Computers and Operations Research, Elsevier, 2011, 39 (9), pp.2122-2132. 〈10.1016/j.cor.2011.10.021〉
Liste complète des métadonnées
Contributeur : François Clautiaux <>
Soumis le : vendredi 4 novembre 2011 - 10:30:46
Dernière modification le : jeudi 21 février 2019 - 10:52:49



Ali Khanafer, François Clautiaux, Said Hanafi, El-Ghazali Talbi. The min-conflict packing problem. Computers and Operations Research, Elsevier, 2011, 39 (9), pp.2122-2132. 〈10.1016/j.cor.2011.10.021〉. 〈hal-00638177〉



Consultations de la notice