Abstract
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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Cambazard, H., & O’Sullivan, B. (2010). Propagating the bin packing constraint using linear programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6308 LNCS, pp. 129–136). Springer Verlag. https://doi.org/10.1007/978-3-642-15396-9_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
