2000 character limit reached
A space-indexed formulation of packing boxes into a larger box
Published 2 Jan 2021 in math.OC, cs.AI, and cs.DM | (2101.00441v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.