Propagating the Bin Packing Constraint Using Linear Programming

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.

• Type: Journal
• Year: 2010
• Where: CP
• Authors: Hadrien Cambazard, Barry O'Sullivan
• Keywords: Artificial Intelligence, Bin Packing, Bin Packing Problem, CP 2010, Linear Continuous Relaxations