Variants of classical one-dimensional bin packing

Document Type

Syllabus

Publication Date

1-1-2007

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.

Identifier

84937675766 (Scopus)

ISBN

[1584885505, 9781584885504, 9781420010749]

Publication Title

Handbook of Approximation Algorithms and Metaheuristics

External Full Text Location

https://doi.org/10.1201/9781420010749

First Page

33

Last Page

33

This document is currently not available here.

Share

COinS