Abstract
We present a theorem which generalizes the max flow—min cut theorem in various ways. In the first place, all versions of m.f.—m.c. (emphasizing nodes or arcs, with graphs directed or undirected, etc.) will be proved simultaneously. Secondly, instead of merely requiring that cuts block all paths, we shall require that our general cuts be weight assignments which meet paths in amounts satisfying certain lower bounds. As a consequence, our general theorem will not only include as a special case m.f.—m.c., but also includes the existence of integral solutions to a transportation problem (with upper bounds on row and column sums) and its dual.
Similar content being viewed by others
References
G.B. Dantzig and A.J. Hoffman, “Dilworth's theorem on partially ordered sets”, in:Linear inequalities and related systems, Annals of mathematics study No. 38, Eds. H.W. Kuhn and A.W. Tucker (Princeton University Press, Princeton, N.J., 1956) pp. 207–214.
J. Edmonds, “Submodular functions, matroids and certain polyhedra”, in:Combinatorial structures and their applications, Eds. H. Guy, H. Hanani, N. Sauer and J. Schonheim (Gordon and Breach, New York, 1970) pp. 69–87.
L.R. Ford, Jr. and D.R. Fulkerson, “Maximal flow through a network”,Canadian Journal of Mathematics 8 (1956) 399–404.
Author information
Authors and Affiliations
Additional information
This work was supported (in part) by the U.S. Army under contract #DAHC04-72-C-0023.
Rights and permissions
About this article
Cite this article
Hoffman, A.J. A generalization of max flow—min cut. Mathematical Programming 6, 352–359 (1974). https://doi.org/10.1007/BF01580250
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580250