Skip to main content
SpringerLink
Log in

Higher-Dimensional Packing with Order Constraints

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 2001)

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

Included in the following conference series:

Abstract

We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional generalizations of scheduling problems. Using graph-theoretic structures to describe feasible solutions, we develop a novel exact branch-and-bound algorithm. This extends previous work by Fekete and Schepers; a key tool is a new order-theoretic characterization of feasible extensions of a partial order to a given comparability graph that is tailor-made for use in a branch-and-bound environment. The usefulness of our approach is validated by computational results.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atmel. AT6000 FPGA configuration guide. Atmel Inc.

    Google Scholar 

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

    Article  MATH  MathSciNet  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. S. P. Fekete, E. Köhler, and J. Teich. Optimal FPGA Module Placement with Temporal Precedence Constraints. In: Proc. DATE 2001, Design, Automation and Test in Europe, pp. 658–665.

    Google Scholar 

  5. S. P. Fekete, E. Köhler, and J. Teich. Extending partial suborders and implication classes. Technical Report 697-2000, TU Berlin.

    Google Scholar 

  6. S. P. Fekete and J. Schepers. A new exact algorithm for general orthogonal d-dimensional knapsack problems. In Algorithms-ESA’97, volume 1284, pp. 144–156, Springer Lecture Notes in Computer Science, 1997.

    Google Scholar 

  7. S. P. Fekete and J. Schepers. New classes of lower bounds for bin packing problems. In Proc. Integer Programming and Combinatorial Optimization (IPCO’98), volume 1412, pp. 257–270, Springer Lecture Notes in Computer Science, 1998.

    Chapter  Google Scholar 

  8. S. P. Fekete and J. Schepers. On more-dimensional packing I: Modeling. Technical Report 97-288, Center for Applied Computer Science, Universität zu Köln, available at http://www.zpr.uni-koeln.de/ABS/papers, 1997.

  9. S. P. Fekete and J. Schepers. On more-dimensional packing II: Bounds. Technical Report 97-289, Universität zu Köln, 1997.

    Google Scholar 

  10. S. P. Fekete and J. Schepers. On more-dimensional packing III: Exact algorithms. Technical Report 97-290, Universität zu Köln, 1997.

    Google Scholar 

  11. T. Gallai. Transitiv orientierbare Graphen. Acta Math. Acd. Sci. Hungar., 18 (1967), pp. 25–66.

    Article  MATH  MathSciNet  Google Scholar 

  12. A. Ghouilà-Houri. Caractérization des graphes non orientés dont on peut orienter les arrêtes de manière à obtenir le graphe d’une relation d’ordre. C.R. Acad. Sci. Paris, 254 (1962), pp. 1370–1371.

    MATH  MathSciNet  Google Scholar 

  13. P.C. Gilmore and A.J. Hoffmann. A characterization of comparability graphs and of interval graphs. Canadian Journal of Mathematics, 16 (1964), pp. 539–548.

    MATH  Google Scholar 

  14. M. Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, 1980.

    Google Scholar 

  15. E. Hadjiconstantinou and N. Christofides. An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European J. of Operations Research, 83 (1995), 39–56.

    Article  MATH  Google Scholar 

  16. C.-H. Huang and J.-Y. Juang. A partial compaction scheme for processor allocation in hypercube multiprocessors. In Proc. of 1990 Int. Conf. on Parallel Proc. pp. 211–217, 1990.

    Google Scholar 

  17. D. Kelly. Comparability graphs. In I. Rival, editor, Graphs and Order, pp. 3–40. D. Reidel Publishing Company, Dordrecht, 1985.

    Google Scholar 

  18. N. Korte and R. Möhring. Transitive orientation of graphs with side constraints. In H. Noltemeier, editor, Proceedings of WG’85, pp. 143–160. Trauner Verlag, 1985.

    Google Scholar 

  19. N. Korte and R. H. M’:ohring. An incremental linear-time algorithm for recognizing interval graphs. SIAM Journal of Computing, 18 (1989), pp. 68–81.

    Article  MATH  MathSciNet  Google Scholar 

  20. A. Krämer. Scheduling Multiprocessor Tasks on Dedicated Processors. Doctoral thesis, Fachbereich Mathematik und Informatik, Universität Osnabrück, 1995.

    Google Scholar 

  21. E. L. Lawler, J. K. Lenstra, A. H. G. Rinooy Kan, and D. B. Shmoys. Sequencing and Scheduling: Algorithms and Complexity. in: S. C. Graves, A. H. G. Rinnooy Kan, and P. H. Zipkin. Logistics of Production and Inventory, vol. 4, Handbooks in Operations Research and Management, pp. 445–522. North-Holland, Amsterdam, 1993

    Google Scholar 

  22. R. H. Möhring. Algorithmic aspects of comparability graphs and interval graphs. In I. Rival, editor, Graphs and Order, pages 41–101. D. Reidel Publishing Company, Dordrecht, 1985.

    Google Scholar 

  23. R. H. Möhring. Algorithmic aspects of the substitution decomposition in optimization over relations, set systems, and Boolean functions. Annals of Oper. Res., 4 (1985), pp. 195–225.

    Article  Google Scholar 

  24. R. H. Möhring, A. S. Schulz, F. Stork, and M. Uetz. Solving Project Scheduling Problems by Minimum Cut Computations. Technical Report 680-2000, TU Berlin.

    Google Scholar 

  25. M. Padberg. Packing small boxes into a big box. Math. Meth. of Op. Res., 52 (2000), pp. 1–21.

    Article  MATH  MathSciNet  Google Scholar 

  26. J. Schepers. Exakte Algorithmen für orthogonale Packungsprobleme. Doctoral thesis, Universität Köln, 1997, available as Technical Report 97-302.

    Google Scholar 

  27. J. Teich, S. Fekete, and J. Schepers. Compile-time optimization of dynamic hardware reconfigurations. In Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA’99), pp. 1097–1103, Las Vegas, U.S.A., June 1999.

    Google Scholar 

  28. J. Teich, S. Fekete, and J. Schepers. Optimization of dynamic hardware reconfigurations. J. of Super computing, 19 (2001), pp. 57–75.

    Article  MATH  Google Scholar 

  29. J. Weglarz. Project Scheduling. Recent Models, Algorithms and Applications. Kluw-ers Academic Publishers, Norwell, MA, USA, 1999.

    Google Scholar 

  30. Xilinx. XC6200 field programmable gate arrays. Tech. report, Xilinx, Inc., October 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Optimization, TU Braunschweig, Braunschweig, Germany

    Sándor P. Fekete

  2. Department of Mathematics, TU Berlin, Berlin, Germany

    Ekkehard Köhler

  3. Computer Engineering Laboratory, University of Paderborn, Paderborn, Germany

    Jürgen Teich

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

    You can also search for this author in PubMed Google Scholar

  2. Ekkehard Köhler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jürgen Teich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Candada, K1S 5B6

    Frank Dehne  & Jörg-Rüdiger Sack  & 

  2. Center for Geometric Computing, Brown University, Providence, RI, 02912-1910, USA

    Roberto Tamassia

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fekete, S.P., Köhler, E., Teich, J. (2001). Higher-Dimensional Packing with Order Constraints. In: Dehne, F., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 2001. Lecture Notes in Computer Science, vol 2125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44634-6_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-44634-6_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42423-9

  • Online ISBN: 978-3-540-44634-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation