Skip to main content
SpringerLink
Log in

Bin Packing with Cardinality Constraints

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 74 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Babel L, Chen B, Kellerer H, Kotov V (2004) Algorithms for on-line bin-packing problems with cardinality constraints. Discret Appl Math 143(1-3):238–251

    Article  MathSciNet  MATH  Google Scholar 

  2. Balogh J, Békési J, Galambos G (2012) New lower bounds for certain classes of bin packing algorithms. Theor Comput Sci 440–441:1–13

    Article  MathSciNet  MATH  Google Scholar 

  3. Caprara A, Kellerer H, Pferschy U (2003) Approximation schemes for ordered vector packing problems. Naval Res Logist 50(1):58–69

    Article  MathSciNet  MATH  Google Scholar 

  4. Dósa G, Epstein L (2014) Online bin packing with cardinality constraints revisited. CoRR abs/1404.1056

    Google Scholar 

  5. Epstein L (2006) Online bin packing with cardinality constraints. SIAM J Discret Math 20(4):1015–1030

    Article  MathSciNet  MATH  Google Scholar 

  6. Epstein L, Levin A (2010) AFPTAS results for common variants of bin packing: a new method for handling the small items. SIAM J Optim 20(6):3121–3145

    Article  MathSciNet  MATH  Google Scholar 

  7. Fujiwara H, Kobayashi K (2013) Improved lower bounds for the online bin packing problem with cardinality constraints. J Comb Optim 1–21. e10.1007/s10878-013-9679-8

  8. Kellerer H, Pferschy U (1999) Cardinality constrained bin-packing problems. Ann Oper Res 92(1):335–348

    Article  MathSciNet  MATH  Google Scholar 

  9. Krause KL, Shen VY, Schwetman HD (1975) Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. J ACM 22(4):522–550

    Article  MathSciNet  MATH  Google Scholar 

  10. Krause KL, Shen VY, Schwetman HD (1977) Errata: “Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems”. J ACM 24(3):527

    Article  MathSciNet  MATH  Google Scholar 

  11. van Vliet A (1992) An improved lower bound for on-line bin packing algorithms. Inf Process Lett 43(5):277–284

    Article  MathSciNet  MATH  Google Scholar 

  12. Yao AC (1980) New algorithms for bin packing. J ACM 27(2):207–227

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by KAKENHI (23700014, 23500014, 26330010, and 26730008).

Author information

Authors and Affiliations

  1. Shinshu University, 1-1 Tenpaku-cho, 441-8580, Nagano, Japan

    Hiroshi Fujiwara

  2. National Institute of Informatics, 2-1-2 Hitotsubashi, 101-8430, Chiyoda-ku, Tokyo, Japan

    Koji M. Kobayashi

Authors
  1. Hiroshi Fujiwara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Koji M. Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hiroshi Fujiwara .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Fujiwara, H., Kobayashi, K.M. (2016). Bin Packing with Cardinality Constraints. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_489

Download citation

Publish with us

Policies and ethics

Search

Navigation