Overview of Network Flow Theory

  • E. L. Lawler
Chapter
Part of the CISM International Centre for Mechanical Sciences book series (CISM, volume 175)

Abstract

Our purpose here is to give a brief review of the principal results of network flow theory, including “classical” results and some newer results concerning the complexity of network flow computations.

Keywords

Network Flow Network Flow Problem Minimal Cost Flow Problem Flow Augmentation Feasible Flow 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, N.J., 1962.MATHGoogle Scholar
  2. [2]
    H. Frank and I. Frisch, Communication, Transportation and Flow Networks, Addison Wesley, Reading, Mass., 1972Google Scholar
  3. [3]
    T.C. Hu, Integer Programming and Network Flows, Addison Wesley, Reading, Mass., 1969.MATHGoogle Scholar
  4. [4]
    E.L. Lawler, Combinatorial Optimization, Chapter 4, to be published by Holt, Rinehart and Winston, New York, N.Y.Google Scholar

Copyright information

© CISM, Udine 1975

Authors and Affiliations

  • E. L. Lawler
    • 1
  1. 1.Dept. of Electrical Engineering and Computer ScienceUniversity of California at BerkeleyUSA

Personalised recommendations