Algorithm 864
Published in ACM Transactions on Mathematical Software • Mar 1, 2007
Authors:,,
Silvano Martello
David Pisinger
Daniele Vigo
Abstract
We consider the problem of orthogonally packing a given set of rectangular-shaped boxes into the minimum number of three-dimensional rectangular bins. The problem is NP-hard in the strong sense and extremely difficult to solve in practice. We characterize relevant subclasses of packing and present a...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!