Abstract
Many linear programming problems can be viewed as a problem of minimizing the “transportation” cost of moving materials through a network to meet demands for material at various locations given sources of material at other locations. Such problems are called network flow problems. They form the most important special class of linear programming problems. Transportation, electric, and communication networks provide obvious examples of application areas. Less obvious, but just as important, are applications in facilities location, resource management, financial planning, and others.
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.
Bazaraa, M., Jarvis, J., & Sherali, H. (1977). Linear programming and network flows (2nd ed.). New York: Wiley.
Bertsekas, D. (1991). Linear network optimization. Cambridge: MIT.
Christofides, N. (1975). Graph theory: An algorithmic approach. New York: Academic.
Dantzig, G. (1951a). Application of the simplex method to a transportation problem. In T. Koopmans (Ed.), Activity analysis of production and allocation (pp. 359–373). New York: Wiley.
Ford, L., & Fulkerson, D. (1958). Constructing maximal dynamic flows from static flows. Operations Research, 6, 419–433.
Ford, L., & Fulkerson, D. (1962). Flows in networks. Princeton: Princeton University Press.
Jensen, P., & Barnes, J. (1980). Network flow programming. New York: Wiley.
Kennington, J., & Helgason, R. (1980). Algorithms for network programming. New York: Wiley.
Lawler, E. (1976). Combinatorial optimization: Networks and matroids. New York: Holt, Rinehart and Winston.
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). Network Flow Problems. In: Linear Programming. International Series in Operations Research & Management Science, vol 285. Springer, Cham. https://doi.org/10.1007/978-3-030-39415-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-39415-8_14
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)