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

Eduarda Pinto Ferreira () and José Fernando Oliveira ()
Additional contact information
Eduarda Pinto Ferreira: ISEP — Instituto Superior de Engenharia do Porto
José Fernando Oliveira: FEUP — Faculdade de Engenharia da Universidade do Porto

A chapter in Intelligent Decision Support, 2008, pp 15-31 from Springer

Abstract: 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.

Keywords: interval graphs; packing (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-8349-9777-7_2

Ordering information: This item can be ordered from
http://www.springer.com/9783834997777

DOI: 10.1007/978-3-8349-9777-7_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().