Skip to main content
SpringerLink
Log in

A note on primal network flow algorithms

  • Abhandlungen
  • Serie A: Theorie
  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

Klein [1967] andDomschke [1973] have developed primal algorithms for network flow problems. An alternative derivation shows that these algorithms implicitly take advantage of duality and end up with an optimal dual solution.

Zusammenfassung

Ausgangspunkt dieser Arbeit sind die Algorithmen vonKlein [1967] undDomschke [1973] zur Bestimmung kostenminimaler Flüsse in Netzwerken. Es werden allgemein interessierende Zusammenhänge zwischen primalen und primal-dualen Algorithmen aufgezeigt.

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

  • Domschke, W.: Two New Algorithms for Minimal Cost Flow Problems. Computing11, 1973, 275–285.

    Google Scholar 

  • Hässig, K.: Theorie verallgemeinerter Flüsse und Potentiale. Operations Research VerfahrenXXI, 1975, 85–98.

    Google Scholar 

  • -: Graphentheoretische Methoden des Operations Research. Stuttgart. To appear 1978.

  • Klein, M.: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems. Management Science14 (3), 1967, 205–220.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Operations Research, Universität Zürich, Weinbergstraße 59, CH-8006, Zürich

    K. Hässig, P. Reiser & C. Stierlin

Authors
  1. K. Hässig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Reiser
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Stierlin
    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

Hässig, K., Reiser, P. & Stierlin, C. A note on primal network flow algorithms. Zeitschrift für Operations Research 22, 195–198 (1978). https://doi.org/10.1007/BF01917660

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation