This is a preview of subscription content, log in via an institution to check access.
Literature Cited
D. A. Suprunenko, “On the traveling-salesman problem,” Kibernetika, No. 5 (1975).
V. S. Aizenshtat and D. N. Kravchuk, “On the minimum of a linear form on the set of all complete cycles of the symmetric group Sn,” Kibernetika, No. 2 (1968).
V. S. Aizenshtat and D. N. Kravchuk, Dokl. Akad. Nauk BSSR,12, No. 5 (1968).
V. S. Aizenshtat and D. N. Kravchuk, “On the extremum of a linear form on the set of all cyclic permutations of degree n,” Kibernetika, No. 6 (1968).
P. S. Klyaus, “Generation of test traveling-salesman problems on an electronic computer,” Preprint. Inst. Mat. Akad. Nauk BSSR, No. 16 (1976).
D. A. Suprunenko, “The traveling-salesman problem,” Vestsi Akad. Nauk BSSR, No. 5 (1975).
V. M. Demidenko, “A special case of the traveling-salesman problem,” Vestsi Akad. Nauk BSSR, No. 5 (1976).
P. S. Klyaus, “Structure of the optimal solutions of certain classes of traveling-salesman problems,” Vestsi Akad. Nauk BSSR, No. 6 (1976).
Additional information
This article was stimulated by [1].
Translated from Kibernetika, No. 4, pp. 80–83, July–August, 1978.
Rights and permissions
About this article
Cite this article
Aizenshtat, V.S., Maksimovich, E.P. Certain classes of traveling-salesman problems. Cybern Syst Anal 14, 565–569 (1978). https://doi.org/10.1007/BF01069839
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069839