IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-8349-9777-7_2.html
   My bibliography  Save this book chapter

Fekete and Schepers’ Graph-based Algorithm for the Two-Dimensional Orthogonal Packing Problem Revisited

In: Intelligent Decision Support

Author

Listed:
  • Eduarda Pinto Ferreira

    (ISEP — Instituto Superior de Engenharia do Porto)

  • José Fernando Oliveira

    (FEUP — Faculdade de Engenharia da Universidade do Porto
    INESC Porto — Instituto de Engenharia de Sistemas e Computadores do Porto)

Abstract

In this paper Fekete and Schepers’ exact algorithm for the non-guillotinable two-dimensional orthogonal packing problem is discussed. A modification to this algorithm is also proposed. The Fekete and Schepers’ algorithm relies on a graph representation of packing patterns to assess if there is a feasible packing for a problem. Yet, the algorithm’s projection graphs construction mechanism sometimes degenerates and while it correctly assesses the existence of a feasible packing pattern, the resulting projection graphs are not equal to the graphs of the packing class to which the packing pattern belongs [1] [2]. The presented algorithm overcomes this problem by introducing an extra condition to avoid the aforementioned degeneration. This modification was tested over instances of previously published literature.

Suggested Citation

  • Eduarda Pinto Ferreira & José Fernando Oliveira, 2008. "Fekete and Schepers’ Graph-based Algorithm for the Two-Dimensional Orthogonal Packing Problem Revisited," Springer Books, in: Andreas Bortfeldt & Jörg Homberger & Herbert Kopfer & Giselher Pankratz & Reinhard Strangmeier (ed.), Intelligent Decision Support, pages 15-31, Springer.
    • Handle: RePEc:spr:sprchp:978-3-8349-9777-7_2
    DOI: 10.1007/978-3-8349-9777-7_2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Keywords

    interval graphs; packing;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-8349-9777-7_2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.