MPQ-trees for orthogonal packing problem

@article{Joncour2010MPQtreesFO,
  title={MPQ-trees for orthogonal packing problem},
  author={C{\'e}dric Joncour and Arnaud P{\^e}cher and Petru Valicov},
  journal={Electronic Notes in Discrete Mathematics},
  year={2010},
  volume={36},
  pages={423-429}
}
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öhring. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

On more-dimensional packing i: Modeling, Technical report, University of Köln

S. P. Fekete, J. Schepers
1997
View 8 Excerpts
Highly Influenced

Carlier and A . Moukrim , A new constraint programming approach for the orthogonal packing problem

F. Clautiaux, A. Jouglet, J.
Computers and Operations Research • 2008

On more-dimensional packing iii: Exact algorithms, Technical report, University of Köln

S. P. Fekete, J. Schepers
1997
View 1 Excerpt

An exact algorithm for orthogonal 2 - d cutting problems using guillotine cuts

N. Christofides, E. Hadjiconstantinou
European Journal of Operational Research • 1995

Similar Papers

Loading similar papers…