Variants of classical one-dimensional bin packing

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

Research output: Chapter in Book/Report/Conference proceedingChapter

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

Fingerprint

Bins
Approximation algorithms
Computational complexity

ASJC Scopus subject areas

  • Computer Science(all)

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

Variants of classical one-dimensional bin packing. / Coffman, Edward G.; Csirik, J.; Leung, Joseph Y.T.

Handbook of Approximation Algorithms and Metaheuristics. CRC Press, 2007. p. 33-1-33-14.

Research output: Chapter in Book/Report/Conference proceedingChapter

Coffman, EG, Csirik, J & Leung, JYT 2007, Variants of classical one-dimensional bin packing. in Handbook of Approximation Algorithms and Metaheuristics. CRC Press, pp. 33-1-33-14. https://doi.org/10.1201/9781420010749
Coffman EG, Csirik J, Leung JYT. Variants of classical one-dimensional bin packing. In Handbook of Approximation Algorithms and Metaheuristics. CRC Press. 2007. p. 33-1-33-14 https://doi.org/10.1201/9781420010749
Coffman, Edward G. ; Csirik, J. ; Leung, Joseph Y.T. / Variants of classical one-dimensional bin packing. Handbook of Approximation Algorithms and Metaheuristics. CRC Press, 2007. pp. 33-1-33-14
@inbook{23a0dff77f694750bc56ac0adb570142,
title = "Variants of classical one-dimensional bin packing",
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.",
author = "Coffman, {Edward G.} and J. Csirik and Leung, {Joseph Y.T.}",
year = "2007",
month = "1",
day = "1",
doi = "10.1201/9781420010749",
language = "English",
isbn = "1584885505",
pages = "33--1--33--14",
booktitle = "Handbook of Approximation Algorithms and Metaheuristics",
publisher = "CRC Press",

}

TY - CHAP

T1 - Variants of classical one-dimensional bin packing

AU - Coffman, Edward G.

AU - Csirik, J.

AU - Leung, Joseph Y.T.

PY - 2007/1/1

Y1 - 2007/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=84937675766&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937675766&partnerID=8YFLogxK

U2 - 10.1201/9781420010749

DO - 10.1201/9781420010749

M3 - Chapter

AN - SCOPUS:84937675766

SN - 1584885505

SN - 9781584885504

SP - 33-1-33-14

BT - Handbook of Approximation Algorithms and Metaheuristics

PB - CRC Press

ER -