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 four-field classification scheme that allows one to create a compact synthesis of the topic, the main results, and the corresponding algorithms.
Galambos, G., Martello, S., Vigo, D. (2025). An Updated Overview of Bin Packing Approximation Algorithms. New York : Springer [10.1007/978-1-4614-6624-6_35-1].
An Updated Overview of Bin Packing Approximation Algorithms
Martello, Silvano
Membro del Collaboration Group
;Vigo, DanieleMembro del Collaboration Group
2025
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 four-field classification scheme that allows one to create a compact synthesis of the topic, the main results, and the corresponding algorithms.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
