Advertisement

Network Flow Problems

  • Robert J. Vanderbei
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 37)

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.

Keywords

Span Tree Tree Solution Linear Programming Problem Simplex Method Dual Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. Ford, L., and Fulkerson, D. (1962), Flows in Networks, Princeton University Press, Princeton, NJ. 240MATHGoogle Scholar
  2. Christofides, N. (1975), Graph Theory: An Algorithmic Approach, Academic Press, New York. 240MATHGoogle Scholar
  3. Lawler, E. (1976), Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York. 240MATHGoogle Scholar
  4. Bazaraa, M., Jarvis, J., and Sherali, H. (1977), Linear Programming and Network Flows, 2 edn, Wiley, New York. 11, 240Google Scholar
  5. Kennington, J., and Helgason, R. (1980), Algorithms for Network Programming, John Wiley and Sons, New York. 240MATHGoogle Scholar
  6. Jensen, P., and Barnes, J. (1980), Network Flow Programming, John Wiley and Sons, New York. 240MATHGoogle Scholar
  7. Ahuja, R., Magnanti, T., and Orlin, J. (1993), Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, NJ. 240, 257Google Scholar
  8. 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, 240Google Scholar
  9. Ford, L., and Fulkerson, D. (1958), `Constructing maximal dynamic flows from static flows’, Operations Research 6, 419–433. 240Google Scholar
  10. Ford, L., and Fulkerson, D. (1962), Flows in Networks, Princeton University Press, Princeton, NJ. 240.MATHGoogle Scholar

Copyright information

© Robert J. Vanderbei 2001

Authors and Affiliations

  • Robert J. Vanderbei
    • 1
  1. 1.Dept. of Operations Research & Financial EngineeringPrinceton UniversityUSA

Personalised recommendations