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.
Preview
Unable to display preview. Download preview PDF.
References
Ford, L. & Fulkerson, D. (1962), Flows in Networks, Princeton University Press, Princeton, Princeton.
Christofides, N. (1975), Graph Theory: An Algorithmic Approach, Academic Press, New York.
Lawler, E. (1976), Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York.
Bazaraa, M., Jarvis, J. & Sherali, H. (1977), Linear Programming and Network Flows, 2 edn, Wiley, New York.
Kennington, J. & Helgason, R. (1980), Algorithms for Network Programming, John Wiley and Sons, New York.
Jensen, P. & Barnes, J. (1980), Network Flow Programming, John Wiley and Sons, New York.
Bertsekas, D. (1991), Linear Network Optimization, The MIT Press, Cambridge, Cambridge.
Ahuja, R., Magnanti, T. & Orlin, J. (1993), Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, NJ.
Dantzig, G. (1951a), Application of the simplex method to a transportation problem, in T. Koopmans, ed., ‘Activity Analysis of Production and Allocation’, John Wiley and Sons, New York, pp. 359–373.
Ford, L. & Fulkerson, D. (1958), ‘Constructing maximal dynamic flows from static flows’, Operations Research 6, 419–433.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Robert J.Vanderbei
About this chapter
Cite this chapter
Vanderbei, R.J. (2008). Network Flow Problems. In: Linear Programming. International Series in Operations Research & Management Science, vol 114. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74388-2_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-74388-2_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74387-5
Online ISBN: 978-0-387-74388-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)