@inbook{59c9b2704af0494e8211796efed537a1,
title = "Propagating the bin packing constraint using linear programming",
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.",
author = "Hadrien Cambazard and Barry O'Sullivan",
year = "2010",
doi = "10.1007/978-3-642-15396-9\_13",
language = "English",
isbn = "364215395X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "129--136",
booktitle = "Principles and Practice of Constraint Programming, CP 2010 - 16th International Conference, Proceedings",
address = "Germany",
note = "16th International Conference on Principles and Practice of Constraint Programming, CP 2010 ; Conference date: 06-09-2010 Through 10-09-2010",
}