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 networkflow 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.
Preview
Unable to display preview. Download preview PDF.
Notes
Ford, L., and Fulkerson, D. (1962), Flows in Networks, Princeton University Press, Princeton, NJ. 240
Christofides, N. (1975), Graph Theory: An Algorithmic Approach, Academic Press, New York. 240
Lawler, E. (1976), Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York. 240
Bazaraa, M., Jarvis, J., and Sherali, H. (1977), Linear Programming and Network Flows, 2 edn, Wiley, New York. 11, 240
Kennington, J., and Helgason, R. (1980), Algorithms for Network Programming, John Wiley and Sons, New York. 240
Jensen, P., and Barnes, J. (1980), Network Flow Programming, John Wiley and Sons, New York. 240
Ahuja, R., Magnanti, T., and Orlin, J. (1993), Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, NJ. 240, 257
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. 10, 240
Ford, L., and Fulkerson, D. (1958), `Constructing maximal dynamic flows from static flows’, Operations Research 6, 419–433. 240
Ford, L., and Fulkerson, D. (1962), Flows in Networks, Princeton University Press, Princeton, NJ. 240.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Robert J. Vanderbei
About this chapter
Cite this chapter
Vanderbei, R.J. (2001). Network Flow Problems. In: Linear Programming. International Series in Operations Research & Management Science, vol 37. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5662-3_13
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5662-3_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5664-7
Online ISBN: 978-1-4757-5662-3
eBook Packages: Springer Book Archive