A space-indexed formulation of packing boxes into a larger box

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.