Abstract
This paper is dedicated to Prof. Dr. Klaus Neumann on the occasion of his entrance into the retirement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco
Hopcroft J, Karp RM (1973) An n 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Comp. 2:225–231
Kämmerer L (1998) Mathematische Behandlung von Stapelproblemen. Dissertation, Bauhaus-Universität Weimar
Kämmerer L, Hempel L (1997) The towers of hanoi and pileproblems. In: Operations Research Proceedings. Springer-Verlag, Berlin, Heidelberg, New York
Vasilkov D, Hempel L (1996) On the computational aspects of the pile problem. Preprint, Bauhaus-Universität Weimar
Giemsch P, Jellinghaus A (2003) Optimization models for the container-ship stowage problems. In: Operations Research Proceedings. Springer-Verlag, Berlin, Heidelberg, New York
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2006 Deutscher Universitäts-Verlag/GWV Fachverlage GmbH, Wiesbaden
About this chapter
Cite this chapter
Hempel, L., Schmiedel, R., Kämmerer, L. (2006). Pile Problems and Their Mathematical Treatment. In: Morlock, M., Schwindt, C., Trautmann, N., Zimmermann, J. (eds) Perspectives on Operations Research. DUV. https://doi.org/10.1007/978-3-8350-9064-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-8350-9064-4_15
Publisher Name: DUV
Print ISBN: 978-3-8350-0234-0
Online ISBN: 978-3-8350-9064-4
eBook Packages: Business and EconomicsBusiness and Management (R0)