Propagating the Bin Packing Constraint Using Linear Programming [chapter]

Hadrien Cambazard, Barry O'Sullivan
2010 Lecture Notes in Computer Science  
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow models, with the filtering of the bin packing constraint. Our experiments show that we often obtain significant improvements in runtime. The DP-flow model is a novel formulation of the problem.
doi:10.1007/978-3-642-15396-9_13 fatcat:5r2inqhajvgkvgjqlsh7dhfz6i