Answers are grounded in this paper and cite their sources.
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 an algorithm which is able to solve moderately large instances to optimality. Extensive computational experiments compare the algorithm for the three-dimensional bin packing when solving general orthogonal packings and when restricted to robot packings.
No takes yet. Share an insight, caveat, or question.
Martello et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: