Abstract
The finding of shortest paths in networks is one of the most basic combinatorial optimization problems, and the algorithms for solving these problems are among the most widely used. The reader is probably aware that a variety of optimization problems, some of which appear to have little to do with paths in networks, can be formulated as shortest path problems.
This work has been supported by the U.S. Air Force Office of Scientific Research Grant 71-2076.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R.E. Bellman, “On a Routing Problem”, Quart. Appl. Math., 16, (April 1958) 87–90.
E.W. Dijkstra, “A Note on Two Problems in Connexion with Graphs”, Numerische Mathematik, 1 (1959) 269–271.
R.W. Floyd, “Algorithm 97, Shortest Path”, Comm. ACM, 5 (June 1962) 345.
E.L. Lawler, “Shortest Paths”, Chapter 3 of Combinatorial Optimization, to be published by Holt, Rinehart and Winston.
S. Warshall, “A Theorem on Boolean Matrices”, J. ACM, 9 (1962), 11–12.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 CISM, Udine
About this chapter
Cite this chapter
Lawler, E.L. (1975). Computing Shortest Paths in Networks. In: Rinaldi, S. (eds) Topics in Combinatorial Optimization. CISM International Centre for Mechanical Sciences, vol 175. Springer, Vienna. https://doi.org/10.1007/978-3-7091-3291-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-7091-3291-3_1
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81339-3
Online ISBN: 978-3-7091-3291-3
eBook Packages: Springer Book Archive