Literaturverzeichnis T. L. Gertzen and M. Grötschel. Flinders Petrie, the Travelling Salesman Problem, and the beginning of mathematical modeling in archaeology. Documenta Mathematica, pages 199–210, 2012. Elektronisch verfügbar unter http://www.zib.de/groetschel/ pubnew/paper/gertzgroe2012.pdf. M. C. Golombic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York. ISBN 1980. R. L. Graham, M. Grötschel, and L. Lovász, editors. Handbook of Combinatorics, Volume I. Elsevier (North-Holland); The MIT Press, Cambridge, Massachusetts, 1995. ISBN ISBN 0-444-82346-8/v.1 (Elsevier); ISBN 0-262-07170-3/v.1 (MIT). M. Grötschel and O. Holland. Solution of large-scale symmetric travelling salesman problems. Mathematical Programming, Series A, 51(2):141–202, 1991. M. Grötschel, M. Jünger, and G. Reinelt. A Cutting Plane Algorithm for the Linear Ordering Problem. Operations Research, 32(6):1195–1220, 1984. M. Grötschel, C. L. Monma, and M. Stoer. Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints. Operations Research, 40(2):309–330, 1992. M. Grötschel, C. L. Monma, and M. Stoer. Design of Survivable Networks. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Network Models, volume 7 of Handbooks in Operations Research and Management Science, pages 617– 672. North-Holland, 1995. M. Grötschel and Y. Yuan. Euler, Mei-Ko Kwan, Königsberg, and a Chinese Postman. Documenta Mathematica, pages 43–50, 2012. Elektronisch verfügbar unter http:// www.zib.de/groetschel/pubnew/paper/groeyuan2012.pdf. G. Gutin and A. P. Punnen, editors. The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, 2002. R. Halin. Graphentheorie. Akademie-Verlag Berlin, 2. edition, 1989. K. Hässig. Graphentheoretische Methoden <strong>des</strong> Operations Research. Teubner-Verlag, Stuttgart, 1979. D. König. Theorie der endlichen und unendlichen Graphen. Akademische Verlagsgesellschaft, Leipzig, 1936. mehrfach auf deutsch und in englischer Übersetzung nachgedruckt. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester, 1985. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Teubner, Stuttgart und Wiley, Chichester, 1990. 57
Literaturverzeichnis J. K. Lenstra. Sequencing by Enumerative Methods. PhD thesis, Mathematisch Centrum, Amsterdam, 1976. J. G. Oxley. Matroid Theory. Oxford University Press, Oxford, 1992. G. Reinelt. The Linear Ordering Problem: Algorithms and Applications. Heldermann Verlag, Berlin, 1985. H. Sachs. Einführung in die Theorie der endlichen Graphen. Teubner, Leipzig, 1970, und Hanser, München, 1971, 1970. M. Stoer. Design of survivable networks. Lecture Notes for Mathematics, 1992. K. Wagner. Graphentheorie. BI Wissenschaftsverlag, Mannheim, 1970. H. Walther and G. Nägler. Graphen, Algorithmen, Programme. VEB Fachbuchverlag, Leipzig, 1987. 58