Abstract
We present different types of techniques for designing algorithms with worst-case performances for the Maximum Travelling Salesman Problem.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Jenkyns T (1979) Greedy travelling salesman's problem Networks. 9:363–373
Kovalev MM, Kotov VM (1981) An analysis of greedy solution for travelling salesman problem. USSR Comput Math and Math Phys N4:1035–1038
Fisher M, Nemhauser G, Wolsey L (1979) An analysis of approximations for finding a maximum weight Hamiltonian circuit. Oper Res 4:799–809
Kovalev MM, Kotov VM (1982) Suboptimal algorithms for solving travelling salesman problem. VINITI N 2403-82:31
Kovalev MM, Kotov VM (1984) An analysis of algorithms for constructing Hamiltonian circuit with maximum weight (russ) Izv AN BSSR. N4:45–50
Kostochka A, Serdukov A (1985) Polynomial algorithms with worst-case performances 3/4 and 5/6 for maximum travelling salesman problem (russ). Controlled System (Novosibirsk) 26:55–598
Kovalev MM, Kotov VM (1986) Worst-case performances of series of heuristics (russ.). Izv Byelorussian Univ 3(1):44–48
Serdukov A (1987) An asymptotically exact algorithm for maximum travelling salesman problem in the Euclidean space (russ). Controlled System (Novosibirsk) 27:79–87
Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report, GSIA, Carnegie-Mellon University
Rozenkrantz D, Stearns R, Lewis P (1977) An analysis of several heuristics for the travelling salesman problem. SIAM J Comput 6:563–581
Serdukov A (1984) An algorithm with performance for maximum traveling salesman problem (russ). Controlled System (Novosibirsk) 25:80–86
Kovalev M, Kotov V (1985) Series of greedy algorithms (russ). Diskrete Optimierung Jena Universitat 93–103
Friese A, Galbiaty G, Maffioli F (1982) On the worst-case performance of some algorithms for asymmetric travelling salesman problem. Networks 12:23–39
Papadimitriou C, Yannakakis M (1993) The travelling salesman problem with distances one and two. Math of Oper Res 18:1–11
Author information
Authors and Affiliations
Additional information
Supported by Byelarussian Fundamental Science Found and DAAD
Rights and permissions
About this article
Cite this article
Kotov, V., Kovalev, M. Maximum travelling salesman problem. Mathematical Methods of Operations Research 43, 169–181 (1996). https://doi.org/10.1007/BF01680370
Issue Date:
DOI: https://doi.org/10.1007/BF01680370