Best-first search methods for constrained two-dimensional cutting stock problems
Operations Research
Computers and Operations Research
Exact algorithms for the guillotine strip cutting/packing problem
Computers and Operations Research
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
The Three-Dimensional Bin Packing Problem
Operations Research
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
Mathematics of Operations Research
Sweep synchronization as a global propagation mechanism
Computers and Operations Research
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem
ACM Transactions on Mathematical Software (TOMS)
A new constraint programming approach for the orthogonal packing problem
Computers and Operations Research
An Exact Algorithm for Higher-Dimensional Orthogonal Packing
Operations Research
The two-dimensional bin packing problem with variable bin sizes and costs
Discrete Optimization
Proceedings of the 15th WSEAS international conference on Computers
WSEAS Transactions on Information Science and Applications
Hi-index | 0.01 |
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.