MPQ-trees for the Orthogonal Packing Problem

Authors:
Cédric Joncour;Arnaud Pêcher;Petru Valicov
Affiliations:
IMB / INRIA Bordeaux - Sud-Ouest, University of Bordeaux, Talence Cedex, France 33405;IRIT, University of Toulouse, Toulouse Cedex 9, France 31062;LaBRI, University of Bordeaux, Talence Cedex, France 33405
Venue:
Journal of Mathematical Modelling and Algorithms
Year:
2012

Citing 6
Cited 0

An incremental linear-time algorithm for recognizing interval graphs

SIAM Journal on Computing
Linear algorithms to recognize interval graphs and test for the consecutive ones property

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation

Computers and Operations Research
A new constraint programming approach for the orthogonal packing problem

Computers and Operations Research
An Exact Algorithm for Higher-Dimensional Orthogonal Packing

Operations Research
On the two-dimensional Knapsack Problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.