Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474162 | Computers & Operations Research | 2008 | 16 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim,