Mathematical Programming

, Volume 7, Issue 1, pp 97–107

Optimal flows in networks with multiple sources and sinks

  • Nimrod Megiddo


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J.B. Ackers, “The use of wye-delta transformation in network simplification”,Journal of Operations Research Society of America 8 (1960) 311–323.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    L.R. Ford and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, N.J., 1962).Google Scholar
  4. [4]
    R.E. Gomory and T.C. Hu, “Multi-terminal network flows”,Journal of the Society for Industrial and Applied Mathematics 9 (1961) 551–570.Google Scholar

Copyright information

© The Mathematical Programming Society 1974

Authors and Affiliations

  • Nimrod Megiddo
    • 1
  1. 1.Tel Aviv UniversityTel AvivIsrael

Personalised recommendations