Sciweavers

COR
2010

Multi-dimensional bin packing problems with guillotine constraints

13 years 11 months ago
Multi-dimensional bin packing problems with guillotine constraints
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while satisfying the requirement that the packing should be guillotine cuttable. That is, there should exist a series of face parallel straight cuts that can recursively cut the bin into pieces so that each piece contains a box and no box has been intersected by a cut. The unrestricted problem is known to be NP-hard. In this paper we present a generalization of a constructive algorithm for the multi-dimensional bin packing problem, with and without the guillotine constraint, based on constraint programming.
Rasmus Resen Amossen, David Pisinger
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where COR
Authors Rasmus Resen Amossen, David Pisinger
Comments (0)