Bin packing approximation algorithms: Survey and classification

Edward G. Coffman, J. Csirik, Gábor Galambos, Silvano Martello, Daniele Vigo

Research output: Chapter

143 Citations (Scopus)

Abstract

The survey presents an overview of approximation algorithms for the classical bin packing problem and reviews the more important results on performance guarantees. Both on-line and off-line algorithms are analyzed. The investigation is extended to variants of the problem through an extensive review of dual versions, variations on bin sizes and item packing, as well as those produced by additional constraints. The bin packing papers are classified according to a novel scheme that allows one to create a compact synthesis of the topic, the main results, and the corresponding algorithms.

Original languageEnglish
Title of host publicationHandbook of Combinatorial Optimization
PublisherSpringer New York
Pages455-531
Number of pages77
Volume1-5
ISBN (Electronic)9781441979971
ISBN (Print)9781441979964
DOIs
Publication statusPublished - jan. 1 2013

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Bin packing approximation algorithms: Survey and classification'. Together they form a unique fingerprint.

  • Cite this

    Coffman, E. G., Csirik, J., Galambos, G., Martello, S., & Vigo, D. (2013). Bin packing approximation algorithms: Survey and classification. In Handbook of Combinatorial Optimization (Vol. 1-5, pp. 455-531). Springer New York. https://doi.org/10.1007/978-1-4419-7997-1_35