Skip to main content
SpringerLink
Log in

Shortest admissible paths. I

  • 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. R. Bellman, “Dynamic programming treatment of the traveling salesman problem,” Kiberneticheskii sbornik, Moscow, no. 9, 1963. (Russian translation of paper in J. Assoc. Comp. Mach., 9, no. 1, 1962).

    Google Scholar 

  2. M. Held and R. M. Karp, “A dynamic programming approach to sequencing problems,” Kibernetichskii sbornik, Moscow, no. 9, 1963. (Russian translation of paper in J. Soc. Indust. Appl. Math., 10, no. 1, 1962).

    Google Scholar 

  3. C. Berge, “Theory of graphs and its applications,” Dunod, Paris, 1958.

    Google Scholar 

  4. J. D. C. Little, K. G. Murty, D. W. Sweeney, and C. Karel, “An algorithm for the traveling salesman problems,” Ekonomika i matematicheskie metody, 1 no. 1, 1965. (Russian translation of paper in Oper. Res., 11, no. 6, 1963).

  5. Yu. M. Ermol'ev, “Optimal flows and admissible paths in networks and multinetworks,” Abstract of thesis, Institute of Cybernetics, AS UkrSSR, Kiev, 1964.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Cybernetics AS UkrSSR, USSR

    Yu. M. Ermol'ev

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

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 2, No. 3, pp. 88–95, 1966

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ermol'ev, Y.M. Shortest admissible paths. I. Cybern Syst Anal 2, 74–79 (1966). https://doi.org/10.1007/BF01071635

Download citation

  • Issue Date:

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

Keywords

Search

Navigation