A space-indexed formulation of packing boxes into a larger box
Not on the map. Why?
Abstract (arXiv)
Current integer programming solvers fail to decide whether 12 unit cubes can be packed into a 1x1x11 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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 20 references that are in the map. First posted on arXiv 2 Jan 2021.
Builds on
0 of 20 references.
No references here yet.
Built on by
Not cited yet.