Skip to main content
Log in

A generalization of the Ford-Fulkerson theorem to multipole networks

  • Published:
Cybernetics Aims and scope

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

Access this article

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

Instant access to the full article PDF.

Literature Cited

  1. L. R. Ford, Jr., and D. R. Fulkerson, Flows in Networks, Princeton Univ. Press (1962).

  2. T. C. Hu, “Multi-commodity network flows,” Oper. Res.,11, 344–360 (1963).

    Google Scholar 

  3. B. Rotschild and A. Whinston, “On two-commodity network flows,” Oper. Res.,14, No. 3, 377–387 (1966).

    Google Scholar 

  4. B. Rotschild, “Computing two-commodity flows,” Oper. Res.,16, No. 2, 446–450 (1968).

    Google Scholar 

  5. V. F. D'yachenko, V. G. Lazarev and G. G. Savvin, Control in Communication Networks [in Russian], Nauka, Moscow (1967).

    Google Scholar 

  6. V. L. Kupershtokh, “A classification problem,” Symp. Mathematical Models and Methods in Socioeconomic Research [in Russian], Novosibirsk (1968).

Download references

Authors

Additional information

Translated from Kibernetika, No. 3, pp. 87–93, May–June, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kupershtokh, V.L. A generalization of the Ford-Fulkerson theorem to multipole networks. Cybern Syst Anal 7, 494–502 (1971). https://doi.org/10.1007/BF01070459

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation