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

Full description

Bibliographic Details

Published in:	Computer science review Vol. 24; pp. 63 - 79
Main Authors:	Christensen, Henrik I., Khan, Arindam, Pokutta, Sebastian, Tetali, Prasad
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.05.2017
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!