MPQ-trees for the Orthogonal Packing Problem
- 68 Downloads
Given a set of rectangular items of different sizes and a rectangular container, the aim of the bi-dimensional Orthogonal Packing Problem (OPP-2 for short) is to decide whether there exists a non-overlapping packing of the items in this container. The rotation of items is not allowed. In this paper we present a new exact algorithm for solving OPP-2, based upon the characterization of solutions using interval graphs proposed by Fekete and Schepers. The algorithm uses MPQ-trees, which were introduced by Korte and Möhring to recognize interval graphs.
KeywordsOrthogonal packing problem MPQ-trees
Unable to display preview. Download preview PDF.
- 4.Booth, K., Lueker, G.: Linear algorithms to recognize interval graphs and test for the consecutive ones property. In: Proceedings of the seventh Annual ACM Symposium on Theory of Computing (STOC’75), pp. 255–265 (1975)Google Scholar
- 10.Fekete, S., Schepers, J.: On more-dimensional packing I: Modeling. Tech. rep., University of Köln, Germany (1997)Google Scholar
- 11.Fekete, S., Schepers, J.: On more-dimensional packing III: Exact algorithms. Tech. rep., University of Köln, Germany (1997)Google Scholar
- 13.Ferreira, E., Oliveira, J.: A note on fekete and schepers’ algorithm for the non-guillotinable two-dimensional packing problem. Technical Report (2005). http://paginas.fe.up.pt/~jfo/techreports/Fekete%20and%20Schepers%20OPP%%20degeneracy.pdf