Article ID: | iaor1989620 |
Country: | Netherlands |
Volume: | 8 |
Issue: | 1 |
Start Page Number: | 17 |
End Page Number: | 20 |
Publication Date: | Feb 1989 |
Journal: | Operations Research Letters |
Authors: | Coppersmith Don, Raghavan Prabhakar |
The authors consider the problem of packing rectangles into bins which are unit squares. They give an on-line algorithm that uses at most 3.25 times the optimal number of bins. The authors also prove a result for the case when the items to be packed are squares and discuss extensions to higher dimensions.