Approximation and online algorithms for multidimensional bin packing: A survey

The bin packing problem is a well-studied problem in combinatorial optimization. In the classical bin packing problem, we are given a list of real numbers in (0,1] and the goal is to place them in a minimum number of bins so that no bin holds numbers summing to more than 1. The problem is extremely...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computer science review Jg. 24; S. 63 - 79
Hauptverfasser:	Christensen, Henrik I., Khan, Arindam, Pokutta, Sebastian, Tetali, Prasad
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.05.2017
Schlagworte:	Approximation algorithms Bin packing Geometric packing Multidimensional packing and covering Multidimensional scheduling Online algorithms Bin packing Online algorithms Approximation algorithms Multidimensional packing and covering Multidimensional scheduling Geometric packing
ISSN:	1574-0137, 1876-7745
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!