Abstract
In this chapter, we discuss briefly the most important applications of network flow problems.
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
References
Ahuja, R., Magnanti, T., & Orlin, J. (1993 ). Network flows: Theory, algorithms, and applications. Englewood Cliffs: Prentice Hall.
Bellman, R. (1957 ). Dynamic programming. Princeton: Princeton University Press.
Dijkstra, E. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269–271.
Elias, P., Feinstein, A., & Shannon, C. (1956). Note on maximum flow through a network. IRE Transactions on Information Theory, IT-2, 117–119.
Ford, L., & Fulkerson, D. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8, 399–404.
Fulkerson, D., & Dantzig, G. (1955). Computation of maximum flow in networks. Naval Research Logistics Quarterly, 2, 277–283.
Hitchcock, F. (1941). The distribution of a produce from several sources to numerous localities. Journal of Mathematical Physics, 20, 224–230.
Howard, R. (1960). Dynamic programming and Markov processes. New York: Wiley.
Kotzig, A. (1956). Súvislost’ a Pravideliná Súvislots’ Konečných Grafov (Technical report). Bratislava: Vysoká Škola Ekonomická.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Vanderbei, R.J. (2020). Applications. In: Linear Programming. International Series in Operations Research & Management Science, vol 285. Springer, Cham. https://doi.org/10.1007/978-3-030-39415-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-39415-8_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-39414-1
Online ISBN: 978-3-030-39415-8
eBook Packages: Business and ManagementBusiness and Management (R0)