Skip to main content
SpringerLink
Log in

Multiterminal network flows and applications

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

The paper discusses the ways to use the condensation technique of Gomory/Hu in the case of non-symmetric networks. Sufficient conditions to get the value of a maximal flow as row resp. column sum of the capacity matrix are derived. Procedures to determine the cut with minimal capacity are developed and applications of the minimal cut technique to problems of optimal sequencing are given.

Zusammenfassung

Das Papier diskutiert die Möglichkeiten, die Kondensationstechnik von Gomory/Hu auf den Fall unsymmetrischer Netzwerke zu übertragen. Es werden hinreichende Bedingungen dafür abgeleitet, daß der Wert eines maximalen Flusses mit der Zeilenbzw. Spaltensumme der Kapazitätsmatrix übereinstimmt. Es werden Verfahren entwickelt, den Schnitt minimaler Kapazität zu bestimmen. Anwendungen der minimalen Schnitt-Technik auf Probleme der optimalen Reihenfolge werden vorgestellt.

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

  • Christofides, N.: Graph Theory. New York 1975.

  • DIW 1972, 1979: Deutsches Institut für Wirtschafsforschung (Ed.): Beiträge zur Strukturforschung, No. 21, Berlin 1972, and No. 54, Berlin 1979.

  • Elmaghraby, S.: Sensitivity Analysis of Multiterminal Flow Networks. Operations Research12, 1964, 680–688.

    Google Scholar 

  • Ford, L., andD. Fulkerson: Flows in Networks, Princeton 1962.

  • Francis, R., andJ. White: Facility layout and location. Englewood Cliffs 1974.

  • Garey, M., andD. Johnson: Computers and Intractability. San Francisco 1979.

  • Gomory, R., andT. Hu: Multiterminal Network Flows. SIAM Journal9, 1961, 551–570.

    Google Scholar 

  • Hu, T.: Integer Programming and Network Flows. Reading 1969.

  • Hu, T., andF. Ruskey: Circular Cuts in a Network. Mathematics of Operations Research5, 1980, 422–434.

    Google Scholar 

  • Korte, B., andW. Oberhofer: Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems. Zeitschrift für Unternehmensforschung11, 1968, 217–231.

    Google Scholar 

  • Neumann, K.: Operations Research Verfahren, Vol. III. München 1975.

  • Schnorr, C.: Multiterminal Network Flows and Connectivity in Unsymmetrical Networks. Optimization and Operations Reseach. Ed. by R. Henn, B. Korte and W. Oettli. (Lecture Notes in Economics and Mathematical Systems, Vol. 157) Berlin 1977, 241–254, and in G. Goos, and H. Hartmanis (Eds.): Automata, Languages and Programming. (Lecture Notes in Computer Science No. 62) Berlin 1978, 425–437.

  • Vahrenkamp, R.: Triangulation and Decomposition of Input-Output Matrices by Network Methods. Proceedings of the V-th Symposium on Operations Research in Cologne, August 25–27, 1980. Methods of Operations Research40, 1981, 437–440.

    Google Scholar 

  • Weil, R.: The Decomposition of Economic Production Systems. Econometrica36, 1968, 260–278.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Wirtschaftswissenschaften der Universität Karlsruhe, Kaiserstraße 12, D-7500, Karlsruhe

    R. Vahrenkamp

Authors
  1. R. Vahrenkamp
    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

Vahrenkamp, R. Multiterminal network flows and applications. Zeitschrift für Operations Research 25, 133–142 (1981). https://doi.org/10.1007/BF01919298

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation