Article ID: | iaor20052255 |
Country: | Netherlands |
Volume: | 33 |
Issue: | 2 |
Start Page Number: | 121 |
End Page Number: | 126 |
Publication Date: | Mar 2005 |
Journal: | Operations Research Letters |
Authors: | Zhang Guochuan |
Keywords: | bin packing |
In the classical two-dimensional bin packing problem one is asked to pack a set of rectangular items, without overlap and without any rotation, into the minimum number of identical square bins. We give an approximation algorithm with absolute worst-case ratio of 3.