A new constraint programming approach for the orthogonal packing problem

The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method for 2OPP, based on a new constraint-based scheduling model. We provide a generalization of energetic reasoning techniques for the problem under investigation. Feasibility tests requiring the solution of subset-sum problems are described. Computational results confirm the efficiency of our method compared to others in the literature. 2006 Elsevier Ltd. All rights reserved.

• Type: Journal
• Year: 2008
• Where: COR
• Authors: François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim
• Keywords: Constraint-based Scheduling Model, COR 2008, Energetic Reasoning Techniques, Two-dimensional Orthogonal Packing