Skip to main content
SpringerLink
Log in

Problem of optimal choice of a route under conditions of time discounting

  • 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

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 travelling salesman problem”, J. Assoc. Comput. Machinery,9, No. 1, 61–63 (1962).

    MATH  Google Scholar 

  2. N. Held and R. M. Karp, “A dynamic programming approach to sequencing problems,” J. Soc. Industr. Appl. Math.,10, No. 1, 196–210 (1962).

    Article  MATH  Google Scholar 

  3. M. Minoux, Mathematical Programming: Theory and Algorithms [Russian translation], Nauka, Moscow (1990).

    Google Scholar 

  4. L. N. Korotaeva, A. N. Sesekin, and A. G. Chentsov, “On one modification of the dynamic programming method in the successive approximation problem,” Zh. Vychisl. matematiki Mat. Fiz.,29, No. 8, 1107–1113 (1989).

    Google Scholar 

  5. L. T. Buslaeva and A. G. Chentsov, “On decomposition of the process of sequential selection of variants,” Mat. Modelirovanie,3, No. 4, 103–113 (1991).

    Google Scholar 

  6. L. N. Korotaeva, E. M. Nazarov, and A. G. Chentsov, “Dynamic programming in one assignment problem,” in: Abstracts of papers of the 5th All-Union Seminar “Methods of synthesis and planning of development of large-scale systems” [in Russian], Zvenigorod (1990), pp. 58–59.

  7. L. N. Korotaeva and A. G. Chentsov, “On a generalization of the traveling salesman problem to ’bottle necks’,” Zh. Vychisl. Mat. Mat. Fiz.,35, No. 7, 1067–1076 (1995).

    Google Scholar 

  8. R. A. Alexandryan and E. A. Mirzakhanyan, General Topology [in Russian], Vysshaya Shkola, Moscow (1979).

    Google Scholar 

  9. A. A. Chikrii and S. F. Kalashnikov, “Pursuit of a group of evaders by a controlled object,” Kibernetika, No. 4, 1–8 (1987).

  10. A. A. Chikriy, L. A. Sobolenko, and S. F. Kalashnikov, “Numerical method for solution of the problem of step-by-step pursuit,” Kibernetika, No. 1, 44–49 (1988).

Download references

Authors
  1. L. V. Tonkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. G. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 95–106, January–February, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tonkov, L.V., Chentsov, A.G. Problem of optimal choice of a route under conditions of time discounting. Cybern Syst Anal 35, 89–99 (1999). https://doi.org/10.1007/BF02667918

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation