This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. K. Leont'ev, “Stability of the traveling salesman problem,” Zh. Vychisl. Mat. Mat. Fiz.,15, No. 5, 1298–1309 (1975).
V. K. Leont'ev, “Stability in combinatorial choice problems,” Dokl. Akad. Nauk SSSR,228, No. 1, 23–25 (1976).
V. K. Leont'ev, “Discrete extremal problems,” Itogi Nauki i Tekhniki, VINITI, Ser. Probability Theory, Mathematical Statistics, Theoretical Cybernetics, Vol. 16, 39–101 (1979).
V. K. Leont'ev, “Stability in linear discrete problems,” Prob. Kibern., No. 35, 169–184 (1979).
É. N. Gordeev and V. K. Leont'ev, “Bottleneck optimization problems,” Voprosy Kibernetiki, Nauchnyi Sovet po Kompleksnoi Probleme “Kibernetika” AN SSSR, Moscow (1980), pp. 5–29.
É. N. Gordeev and V. K. Leont'ev, “Stability in bottleneck problems,” Zh. Vychisl. Mat. Mat. Fiz., No. 4, 1071–1075 (1980).
É. N. Gordeev, “Stability in bottleneck problems with perturbation of some path elements,” Sbornik Rabot po Matematicheskoi Kibernetike, VTs AN SSSR, Moscow (1981), pp. 121–142.
É. N. Gordeev and V. K. Leont'ev, “Parametric path problems,” Zh. Vychisl. Mat. Mat. Fiz., No. 1, 37–46 (1984).
É. N. Gordeev, V. K. Leont'ev, and I. Kh. Sigal, “Computer algorithms to find the stability radius in choice problems,” Zh. Vychisl. Mat. Mat. Fiz., No. 4, 973–979 (1983).
R. E. Tarjan, “Sensitivity analysis of minimum spanning trees and shortest path trees,” Inform. Process. Lett.,14, 30–33 (1982).
D. R. Shier and G. Witzgall, “Arc tolerances in shortest path and network flow problems,” Networks,10, 277–291 (1980).
S. E. Elmaghraby, “Sensitivity analysis of multitermal flow networks,” Oper. Res.,12, 680–688 (1964).
Yu. I. Zhuravlev, “On an algebraic approach to the solution of recognition or classification problems,” Probl. Kibern., No. 33, 5–68 (1978).
V. K. Leont'ev, “The algebraic structure of some discrete programming problems,” Probl. Kibern., No. 26, 279–290 (1973).
S. N. Chernikov, Linear Inequalities [in Russian], Nauka, Moscow (1968).
V. A. Perepelitsa, “On two problems in graph theory,” Dokl. Akad. Nauk SSSR,194, No. 6, 1269–1272 (1980).
É. Kh. Gimadi and V. A. Perepelitsa, “An asymptotic approach to the solution of the traveling salesman problem,” Upr. Sist., No. 12, 2–5 (1974).
V. G. Vizing, “The values of the objective functional in the sequencing problem majorized by the mean value,” Kibernetika, No. 5, 76–78 (1973).
V. K. Leont'ev, “An investigation of one algorithm for the traveling salesman problem,” Zh. Vychisl. Mat. Mat. Fiz.,13, No. 5, 1228–1236 (1973).
É. N. Gordeev and V. K. Leont'ev, “Complexity bounds for tabulation of path problems,” Zh. Vychisl. Mat. Mat. Fiz., No. 8, 12–15 (1985).
I. V. Sergienko and N. V. Filonenko, “The solution of some stability problem in integer linear programming,” Dokl. Akad. Nauk UkrSSR, No. 6, 79–82 (1982).
L. N. Kozeratskaya, “On the solution of one type of linear parametric programming problems,” Kibernetika, No. 1, 81–87 (1981).
I. V. Sergienko and L. N. Kozeratskaya, “On the solution of one problem of parametric integer programming,” Kibernetika, No. 3, 80–84 (1982).
L. N. Kozeratskaya, T. T. Lebedeva, and I. V. Sergienko, “Stability, parametric and postoptimal analysis of discrete optimization problems,” Kibernetika, No. 4, 71–80 (1983).
É. N. Gordeev, V. K. Lent'ev, and S. P. Tarasov, “Computing the stability radius in special cases,” 1st All-Union Conf. on Statistical and Discrete Analysis of Nonnumerical Information, Expert Judgments, and Discrete Optimization, abstracts of papers [in Russian], Moscow-Alma-Ata (1981).
Additional information
Translated from Kibernetika, No. 5, pp. 82–89, 105, September–October, 1986.
Rights and permissions
About this article
Cite this article
Leont'ev, V.K., Gordeev, É.N. Qualitative investigation of path problems. Cybern Syst Anal 22, 636–646 (1986). https://doi.org/10.1007/BF01068361
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068361