Variants of classical one-dimensional bin packing

Edward G. Coffman, János Csirik, Joseph Y.T. Leung

Research output: Chapter

16 Citations (Scopus)

Abstract

Few problems compete with the bin packing problem in having fascinated so many people for so long a time. Research into the classical bin packing problem dates back over three decades to the early 1970s. In the original version, a list L = (a1, a2, …, an) of n items, each with a size no larger than 1, is given along with an infinite supply of unit capacity bins. The goal is to pack the list into as few bins as possible so that no bin capacity is exceeded. Because the problem is NP-hard, most research has concentrated on designing fast approximation algorithms with good performance guarantees. The studies have spanned both online and offline algorithms, and have applied both combinatorics and probabilistic analysis.

Original languageEnglish
Title of host publicationHandbook of Approximation Algorithms and Metaheuristics
PublisherCRC Press
Pages33-1-33-14
ISBN (Electronic)9781420010749
ISBN (Print)1584885505, 9781584885504
DOIs
Publication statusPublished - jan. 1 2007

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Variants of classical one-dimensional bin packing'. Together they form a unique fingerprint.

  • Cite this

    Coffman, E. G., Csirik, J., & Leung, J. Y. T. (2007). Variants of classical one-dimensional bin packing. In Handbook of Approximation Algorithms and Metaheuristics (pp. 33-1-33-14). CRC Press. https://doi.org/10.1201/9781420010749