A new constraint programming approach for the orthogonal packing problem

13 years 4 months ago

Download www.math.tu-dresden.de

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.

François Clautiaux, Antoine Jouglet, Jacque

Real-time Traffic

Constraint-based Scheduling Model | COR 2008 | Energetic Reasoning Techniques | Two-dimensional Orthogonal Packing |

claim paper

» A General Framework for Bounds for HigherDimensional Orthogonal Packing Problems

» Multidimensional bin packing problems with guillotine constraints

» A cuttingplane approach for the twodimensional orthogonal nonguillotine cutting problem

» The TVBreak Packing Problem

» New approaches to covering and packing problems

» A CLP Approach to the Protein SideChain Placement Problem

» Search Strategies for Rectangle Packing

» Faster FixedParameter Tractable Algorithms for Matching and Packing Problems

Post Info
More Details (n/a)

Added	25 Dec 2010
Updated	25 Dec 2010
Type	Journal
Year	2008
Where	COR
Authors	François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim

Comments (0)

Sciweavers

A new constraint programming approach for the orthogonal packing problem

Constraint-based Scheduling Model | COR 2008 | Energetic Reasoning Techniques | Two-dimensional Orthogonal Packing |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers