Skip to main content
SpringerLink
Log in

Optimal flows in networks with multiple sources and sinks

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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. 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. L.R. Ford and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, N.J., 1962).

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Tel Aviv University, Tel Aviv, Israel

    Nimrod Megiddo

Authors
  1. Nimrod Megiddo
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Megiddo, N. Optimal flows in networks with multiple sources and sinks. Mathematical Programming 7, 97–107 (1974). https://doi.org/10.1007/BF01585506

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01585506

Keywords

Search

Navigation