Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

42

ENDM
2010

favoriteEmaildiscussreport

127views more ENDM 2010»

MPQ-trees for orthogonal packing problem

13 years 11 months ago

MPQ-trees for orthogonal packing problem

Download www.labri.fr

Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big" rectangular container without overlapping. The rotation of items is not allowed. In this paper we present a new algorithm for solving OPP-2, based on the characterization of solutions using interval graphs proposed by Fekete and Schepers. The algorithm uses MPQ-trees - combinatorial structures introduced by Korte and M

Cédric Joncour, Arnaud Pêcher, Petru

Real-time Traffic

Bi-dimensional Orthogonal Packing | ENDM 2010 | Feasible Solution | Rectangular Boxes |

claim paper

Related Content

» Improved Absolute Approximation Ratios for TwoDimensional Packing Problems

» A General Framework for Bounds for HigherDimensional Orthogonal Packing Problems

» Resource augmentation in twodimensional packing with orthogonal rotations

» A new constraint programming approach for the orthogonal packing problem

» A cuttingplane approach for the twodimensional orthogonal nonguillotine cutting problem

» Multidimensional bin packing problems with guillotine constraints

» A MIP approach for some practical packing problems Balancing constraints and tetrislike it...

» Binary space partitions of orthogonal subdivisions

» A genetic algorithm for the twodimensional strip packing problem with rectangular pieces

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	ENDM
Authors	Cédric Joncour, Arnaud Pêcher, Petru Valicov

Comments (0)