Skip to main content
SpringerLink
Log in

Consistency Check for the Bin Packing Constraint Revisited

  • Conference paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6140))

Abstract

The bin packing problem (BP) consists in finding the minimum number of bins necessary to pack a set of items so that the total size of the items in each bin does not exceed the bin capacity C. The bin capacity is common for all the bins.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Shaw, P.: A constraint for bin packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648–662. Springer, Heidelberg (2004)

    Google Scholar 

  2. 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 

  3. Labbé, M., Laporte, G., Mercure, H.: Capacitated vehicle routing on trees. Operations Research 39(4), 616–622 (1991)

    Article  MATH  Google Scholar 

  4. Bourjolly, J.M., Rebetez, V.: An analysis of lower bound procedures for the bin packing problem. Comput. Oper. Res. 32(3), 395–405 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Scholl, A.: Data of assembly line balancing problems. Technische Universität Darmstadt (93)

    Google Scholar 

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

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, UCLouvain, Belgium

    Julien Dupuis & Yves Deville

  2. Dynadec Europe, Belgium

    Pierre Schaus

Authors
  1. Julien Dupuis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Schaus
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yves Deville
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DEIS, University of Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Andrea Lodi , Michela Milano  & Paolo Toth ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dupuis, J., Schaus, P., Deville, Y. (2010). Consistency Check for the Bin Packing Constraint Revisited. In: Lodi, A., Milano, M., Toth, P. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2010. Lecture Notes in Computer Science, vol 6140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13520-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13520-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13519-4

  • Online ISBN: 978-3-642-13520-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation