Skip to main content
SpringerLink
Log in

Propagating the Bin Packing Constraint Using Linear Programming

  • Conference paper
Principles and Practice of Constraint Programming – CP 2010 (CP 2010)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6308))

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.

This work was supported by Science Foundation Ireland (Grant Number 05/IN/I886).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Clautiaux, F., Alves, C., de Carvalho, J.M.V.: A survey of dual-feasible and superadditive functions. Annals of Operations Research (2008)

    Google Scholar 

  2. de Carvalho, J.M.V.: Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research 86, 629–659 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. de Carvalho, J.M.V.: LP models for bin packing and cutting stock problems. European Journal of Operational Research 141(2), 253–273 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2, 5–30 (1996)

    Article  Google Scholar 

  5. Hooker, J.N.: Integrated Methods for Optimization. International Series in Operations Research & Management Science. Springer, New York (2006)

    Google Scholar 

  6. Hooker, J.N., Yan, H.: A relaxation of the cumulative constraint. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 686–690. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. 28(1), 59–70 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Scholl, A., Klein, R., Jürgens, C.: Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers and Operations Research 24(7), 627–645 (1997)

    Article  MATH  Google Scholar 

  9. Shaw, P.: A constraint for bin packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648–662. Springer, Heidelberg (2004)

    Google Scholar 

  10. Trick, M.A.: A dynamic programming approach for consistency and propagation for knapsack constraints. Annals OR 118(1-4), 73–84 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland

    Hadrien Cambazard & Barry O’Sullivan

Authors
  1. Hadrien Cambazard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Barry O’Sullivan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Royal Holloway, University of London, Egham, TW20 0EX, Surrey, United Kingdom

    David Cohen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cambazard, H., O’Sullivan, B. (2010). Propagating the Bin Packing Constraint Using Linear Programming. In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15396-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15395-2

  • Online ISBN: 978-3-642-15396-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation