Sciweavers

CP
2010
Springer

Propagating the Bin Packing Constraint Using Linear Programming

13 years 2 months ago
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.
Hadrien Cambazard, Barry O'Sullivan
Added 24 Jan 2011
Updated 24 Jan 2011
Type Journal
Year 2010
Where CP
Authors Hadrien Cambazard, Barry O'Sullivan
Comments (0)