| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143131 | Operations Research Letters | 2012 | 5 Pages |
Abstract
Current integer programming solvers fail to decide whether 12 unit cubes can be packed into a 1Ã1Ã11 box within an hour using the natural relaxation of Chen/Padberg. We present an alternative relaxation of the problem of packing boxes into a larger box, which makes it possible to solve much larger instances.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sam D. Allen, Edmund K. Burke, Jakub MareÄek,