Skip to main content
SpringerLink
Log in

A new exact algorithm for general orthogonal d-dimensional knapsack problems

  • Conference paper
  • First Online:
Algorithms — ESA '97 (ESA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1284))

Included in the following conference series:

Abstract

The d-dimensional orthogonal knapsack problem (OKP) has a wide range of practical applications, including packing, cutting, and scheduling. We present a new approach to this problem, using a graph theoretical characterization of feasible packings. This characterization allows us to deal with classes of packings that share a certain combinatorical structure, instead of single ones. Combining the use of this structure with other heuristics, we develop a two-level tree search algorithm for fording exact solutions for the d-dimensional OKP. Computational results are reported, including optimal solutions for all two-dimensional test problems from recent literature.

Supported by the German Federal Ministry of Education, Science, Research and Technology (BMBF, Förderkennzeichen 01 IR 411 C7)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Arenales and R. Morabito. An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems. European Journal of Operations Research, 84, 1995, pp. 599–617.

    Google Scholar 

  2. J. E. Beasley. An exact two-dimensional non-guillotine cutting stock tree search procedure. Operations Research, 33, 1985, pp. 49–64.

    Google Scholar 

  3. J. E. Beasley. OR-Library: distributing test problems by electronic mail. Journal of the Operations Research Society, 41, 1990, pp. 1069–1072.

    Google Scholar 

  4. M. Bird and E. Boros. Network flows and non-guillotine cutting patterns. European Journal of Operations Research, 16, 1984, pp. 215–221.

    Google Scholar 

  5. N. Christofides and C. Whitlock. An algorithm for two-dimensional cutting problems. Operations Research, 25, 1977, pp. 31–44.

    Google Scholar 

  6. K. A. Dowsland. An exact algorithm for the pallet loading problem. European Journal of Operations Research, 31, 1987, pp. 78–84.

    Google Scholar 

  7. S. P. Fekete and H. Meijer. Rectangle and box visibility graphs in 3D. To appear in International Journal of Computational Geometry and its Applications. Available at ftp://ftp.zpr.uni-koeln.de/pub/paper/zpr96-224.ps.gz.

    Google Scholar 

  8. S. P. Fekete and J. Schepers. A new classs of lower bounds for bin packing problems. ZPR Report 97-265. Available at ftp://ftp.zpr.uni-koeln.de/pub/ paper/zpr97-265.ps.gz.

    Google Scholar 

  9. S. P. Fekete, J. Schepers, and M. Wottawa. PACKLIB: a library of packing problems. Under construction.

    Google Scholar 

  10. G. Galambos and G. J. Woeginger. On-line bin packing-a restricted survey. Zeitschrift für Operations Research, 42, 1995, pp. 25–45.

    Google Scholar 

  11. M. C. Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, New York, 1980.

    Google Scholar 

  12. E. Hadjiconstantinou and N. Christofides. An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European Journal of Operations Research, 83, 1995, pp. 39–56.

    Google Scholar 

  13. M. R. Jerrum. A data structure for systems of orthogonal, non-overlapping rectangles. Internal Report CSR-239-87, Department of Computer Science, Edinburgh University, August 1987.

    Google Scholar 

  14. N. Korte and R. H. Möhring. An incremental linear-time algorithm for recognizing interval graphs. Siam Journal of Computing, 18, 1989, pp. 68–81.

    Google Scholar 

  15. S. Martello and P. Toth. Knapsack Problems-Algorithms and Computer Implementations, Wiley, Chichester, 1990.

    Google Scholar 

  16. J. Schepers. Exakte Algorithmen für orthogonale Packungsprobleme. Doctoral thesis, Universität zu Köln, in preparation for 1997.

    Google Scholar 

  17. P. Y. Wang. Two algorithms for constrained two-dimensional cutting stock problems. Operations Research, 31, 1983, pp. 573–586.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Parallel Computing, Universität zu Köln, D-50923, Köln, Germany

    Sándor P. Fekete & Jörg Schepers

Authors
  1. Sándor P. Fekete
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jörg Schepers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rainer Burkard Gerhard Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fekete, S.P., Schepers, J. (1997). A new exact algorithm for general orthogonal d-dimensional knapsack problems. In: Burkard, R., Woeginger, G. (eds) Algorithms — ESA '97. ESA 1997. Lecture Notes in Computer Science, vol 1284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63397-9_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-63397-9_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63397-6

  • Online ISBN: 978-3-540-69536-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation