Skip to Main content Skip to Navigation
Journal articles

Bin Packing with conflicts: a generic branch-and-price algorithm

Ruslan Sadykov 1, 2 François Vanderbeck 1, 2
1 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : In the the bin packing problem with conflicts, one has to pack items in the minimum number of bins while avoiding joint assignments of items that are in conflict. Our study shows a comparatively good performance of a generic Branch-and-Price algorithm for this problem. We made use of our black box solver BaPCod, relying on its generic branching scheme and primal heuristics, while developing a specific pricing oracle. For the case where the conflict graph is an interval graph, we propose a fast dynamic programming algorithm for pricing, while for the general case we use a classic depth-first-search branch-and-bound approach. The algorithm is tested on instances from the literature where the conflict graph is an interval graph, as well as on newly generated instances with an arbitrarily conflict graph. The computational results show that the generic algorithm outperforms special purpose algorithms of the literature, closing all open instances in one hour of CPU time.
Document type :
Journal articles
Complete list of metadatas
Contributor : Ruslan Sadykov <>
Submitted on : Thursday, November 25, 2010 - 1:53:48 PM
Last modification on : Monday, November 25, 2019 - 11:26:13 AM

Links full text




Ruslan Sadykov, François Vanderbeck. Bin Packing with conflicts: a generic branch-and-price algorithm. INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2013, 25 (2), pp.244-255. ⟨10.1287/ijoc.1120.0499⟩. ⟨inria-00539869⟩



Record views