Multidimensional on-line bin packing: Algorithms and worst-case analysis

Authors:
Don Coppersmith;Prabhakar Raghavan
Affiliations:
IBM Research Division, T.J. Watson Research Center, Box 218, Yorktown Heights, NY 10598, USA;IBM Research Division, T.J. Watson Research Center, Box 218, Yorktown Heights, NY 10598, USA
Venue:
Operations Research Letters
Year:
1989

Citing 2
Cited 8

On-line bin packing in linear time

Journal of Algorithms
A probabilistic analysis of multidimensional bin packing problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Sequential vector packing

Theoretical Computer Science
Two-dimensional online bin packing with rotation

Theoretical Computer Science
Dynamic multi-dimensional bin packing

Journal of Discrete Algorithms
Bounds for online bounded space hypercube packing

Discrete Optimization
An on-line algorithm for multidimensional bin packing

Operations Research Letters
Online strip packing with modifiable boxes

Operations Research Letters
Sequential vector packing

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of packing rectangles into bins which are unit squares. We give an on-line algorithm that uses at most 3.25 times the optimal number of bins. We also prove a result for the case when the items to be packed are squares and discuss extensions to higher dimensions.