Skip to main content
SpringerLink
Log in

Stability of a routing optimization algorithm

  • Brief Communication
  • 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, “Application of dynamic programming to the traveling salesman problem,” Kibern. Sb., 9, 219–222 (1964).

    Google Scholar 

  2. R. Bellman and R. Calaba, Dynamic Programming and Modern Control Theory [Russian translation], Nauka, Moscow (1969).

  3. V. S. Mikhalevich and A. I. Kuksa, Sequential Optimization Methods in Discrete Network Problems of Optimal Resource Allocation [in Russian], Nauka, Moscow (1983).

  4. V. S. Tanaev, Yu. N. Sotskov, and V. A. Strusevich, Scheduling Theory. Multistage Systems [in Russian], Nauka, Moscow (1989).

  5. V. K. Leont'ev, “Stability of the traveling salesman problem,” Zh. Vychisl. Matem. Mat. Fiz., 15, No. 5, 1298–1309 (1975).

    MATH  Google Scholar 

  6. E. N. Gordeev, V. K. Leont'ev, and I. Kh. Sigal, “Computer algorithms to find the stability radius in selection problems,” Zh. Vychisl. Matem. Mat. Fiz., 23, No. 4, 973–979 (1983).

    MATH  Google Scholar 

  7. E. N. Gordeev and V. K. Leont'ev, “Using stability analysis to solve selection problems,” in: Mathematical Methods in Pattern Recognition and Discrete Optimization [in Russian], VTs AN SSSR, Moscow (1987), pp. 36–51.

    Google Scholar 

  8. Yu. N. Sotskov, “Stability analysis of the approximate solution of the 0-1 minimization problem for a linear form,” Zh. Vychisl. Matem. Mat. Fiz., 33, No. 5, 785–795 (1993).

    MATH  Google Scholar 

  9. L. N. Kozeratskaya, T. T. Lebedeva, and I. V. Sergienko, “Discrete optimization problems: stability analysis,” Ob. Prikal. Promysh. Mat., 2, No. 1, 13–30 (1993).

    Google Scholar 

  10. L. T. Buslaeva and A. G. Chentsov, “Decomposition of the process of sequential choice of alternatives,” Mat. Model., 3, No. 4, 103–113 (1991).

    Google Scholar 

Download references

Authors
  1. L. T. Buslaeva
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 179–183, September–October, 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Buslaeva, L.T. Stability of a routing optimization algorithm. Cybern Syst Anal 33, 754–756 (1997). https://doi.org/10.1007/BF02667202

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation