Skip to main content
SpringerLink
Log in

The shortest admissible paths. II

  • Published:
Cybernetics Aims and scope

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

References

  1. Yu. M. Ermol'ev, “The shortest admissible paths. I, “Kibernetika [Cybernetics], no. 3, Kiev, 1966.

  2. E. G. Gol'shtein and D. B. Yudin, New Directions in Linear Programming [in Russian], izd-vo Sovetskoe radio, Moscow, 1966.

    Google Scholar 

  3. L. R. Ford and D. R. Fulkerson, Flows in Networks [Russian translation], izd-vo Mir, Moscow, 1966.

    Google Scholar 

  4. R. Bellman and S. E. Dreyfus, Applied Dynamic Programming [Russian translation], izd-vo Nauka, Moscow, 1965.

    Google Scholar 

  5. C. Berge, Theory of Graphs and their Applications [Russian translation], IL, Moscow, 1962.

    Google Scholar 

  6. A. A. Fel'dbaum, Fundamentals of the Theory of Optimal Automatic Systems [in Russian], izd-vo Nauka, Moscow, 1966.

    Google Scholar 

  7. V. S. Mikhalevich and V. V. Shkurba, “Sequential optimization methods in problems of operation scheduling,” Kibernetika [Cybernetics], no. 2, Kiev, 1966.

  8. M. Held and R. Karp, “Application of dynamic programming to problems of ordering,” Kiberneticheskii sbornik, no. 9, Moscow, 1963.

  9. Yu. I. Shilin and P. A. Moroz, “On the statement of the problem of the optimal control of the main oil pipelines working from ‘pump to pump’,” Neftyanoe khozyaistvo, no. 1, Moscow, 1966.

Download references

Author information

Authors and Affiliations

  1. Cybernetics Institute AS UkrSSR, USSR

    Yu. M. Ermol'cv & I. M. Mel'nik

Authors
  1. Yu. M. Ermol'cv
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. M. Mel'nik
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 3, No. 1, pp. 63–71, 1966

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ermol'cv, Y.M., Mel'nik, I.M. The shortest admissible paths. II. Cybern Syst Anal 3, 52–58 (1967). https://doi.org/10.1007/BF01072848

Download citation

  • Issue Date:

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

Keywords

Search

Navigation