finale Version des Vorlesungsskripts - ZIB

Literaturverzeichnis
Literaturverzeichnis
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows, Handbooks in Operations
Research and Management Science, volume 1, chapter Optimization, pages 211–360.
Elsevier, North-Holland, Amsterdam, 1989.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows, Theory, Algorithms and
Applications. Paramount Publishing International, Prentice Hall, New York, 1993.
M. Grötschel. Tiefensuche: Bemerkungen zur Algorithmengeschichte. In H. Hecht,
R. Mikosch, I. Schwarz, H. Siebert, and R. Werther, editors, Kosmos und Zahl - Beiträge
zur Mathematik- und Astronomiegeschichte, zu Alexander von Humboldt und
Leibniz, volume 58 of Boethius, pages 331–346. Franz Steiner Verlag, 2008. URL
http://www.steiner-verlag.de/titel/56734.html.
T. C. Hu. Integer Programming and Network Flows. Addison-Wesley, Reading, Massachusetts,
1969.
P. A. Jensen and J. W. Barnes. Network Flow Programming. Wiley & Sons, New York,
1980.
D. Jungnickel. Graphs, Networks and Algorithms. Springer, 4. edition, 2013.
J. Kennington and R. Helgason. Algorithms for Network Programming. Wiley & Sons,
New York, 1980.
H. W. Kuhn. The hungarian method for the assignment problem. Naval Logistics Quarterly,
2:83–97, 1955.
H. W. Kuhn. A tale of three eras: The discovery and rediscovery of the Hungarian
Method. European Journal of Operational Research, 219:641–651, 2012.
J. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press,
Princeton, 1962.
E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart &
Winston, New York, 1976.
S. I. M. Shigeno and S. T. McCormick. Relaxed most negative cycle and most positive
cut canceling algorithms for minimum cost flow. Mathematics of Operations Research,
25:76–104, 2000.
E. T. V. Goldberg and R. E. Tarjan. Network flow algorithms. In in B. Korte et al.
(eds.), editor, Paths, Flows, and VLSI-Layout. Springer-Verlag, Berlin, 1990.
149