Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Max-flow min-cut theorem

  • Saul I. Gass
  • Carl M. Harris
Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_602

For a maximum-flow network problem, it can be shown that the maximum flow through the network is equal to the minimum capacity of all the cuts that separate the source (origin) and the sink (destination) nodes, where the capacity of a cut is the sum of the capacities of the arcs in the cut. Maximum-flow network problem.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Saul I. Gass
    • 1
  • Carl M. Harris
    • 2
  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA