| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524047 | Operations Research Letters | 2005 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Guochuan Zhang,