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

Celý popis

Podrobná bibliografie

Vydáno v:	Computer science review Ročník 24; s. 63 - 79
Hlavní autoři:	Christensen, Henrik I., Khan, Arindam, Pokutta, Sebastian, Tetali, Prasad
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.05.2017
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!