Optimal flows in networks with multiple sources and sinks
Received: 19 February 1974 Revised: 06 May 1974 DOI:
Cite this article as: Megiddo, N. Mathematical Programming (1974) 7: 97. doi:10.1007/BF01585506 Abstract
The concept of an optimal flow in a multiple source, multiple sink network is defined. It generalizes maximal flow in a single source, single sink network. An existence proof and an algorithm are given.
J.B. Ackers, “The use of wye-delta transformation in network simplification”,
Journal of Operations Research Society of America 8 (1960) 311–323.
L.R. Ford and D.R. Fulkerson, “A simple algorithm for finding maximal network flows and an application to the Hitchcock problem”,
Canadian Journal of Mathematics 9 (1957) 210–218.
L.R. Ford and D.R. Fulkerson,
Flows in networks (Princeton University Press, Princeton, N.J., 1962).
R.E. Gomory and T.C. Hu, “Multi-terminal network flows”,
Journal of the Society for Industrial and Applied Mathematics 9 (1961) 551–570. Copyright information
© The Mathematical Programming Society 1974