Skip to main content
Log in

Optimal network-flow-distribution algorithms

  • Systems Analysis
  • Published:
Cybernetics and Systems Analysis 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.

References

  1. B. N. Pshenichnyi, “Design of energy networks on electronic computers,“Zh. Vychisl. Mat. Mat. Fiz.,2, No. 5, 942–947 (1962).

    Google Scholar 

  2. O. Ore,Graphs and Their Application [Russian translation], Mir, Moscow (1965).

    Google Scholar 

  3. C. T. Hansen, K. Madsen, and H. B. Nielsen, “Optimization of pipe networks,“Math. Programming, No. 52, 45–58 (1991).

    Google Scholar 

  4. E. E. Kirik, “Program for calculation of network flows,“ in:Modeling and Optimization [in Russian], Inst. Cybernetics, Acad. Sci. Ukr. SSR, Kiev (1991), pp. 16–19.

    Google Scholar 

  5. B. N. Pshenichnyi,Necessary Conditions of an Extreme [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  6. J. Forsythe, M. Malcomb, and K. Mowler,Computer Methods of Mathematical Computations [Russian translation], Mir, Moscow (1980).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 29–39, July–August, 1993.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pshenichnyi, B.N., Kirik, E.E. Optimal network-flow-distribution algorithms. Cybern Syst Anal 29, 490–499 (1993). https://doi.org/10.1007/BF01125863

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation