• Title of article

    MPQ-trees for orthogonal packing problem

  • Author/Authors

    Joncour، نويسنده , , Cédric and Pêcher، نويسنده , , Arnaud and Valicov، نويسنده , , Petru، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2010
  • Pages
    7
  • From page
    423
  • To page
    429
  • Abstract
    Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP-2) 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.
  • Keywords
    interval graph , MP Q-tree , orthogonal packing problem
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Serial Year
    2010
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Record number

    1455431

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=1455431