|
Avtomatika i Telemekhanika, 2015, Issue 3, Pages 125–134
(Mi at14202)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
System Analysis and Operations Research
Approximate algorithms for the traveling salesman problem. II
S. I. Sergeev Moscow State University of Economics, Statistics, and Informatics, Moscow, Russia
Abstract:
We present several approximate algorithms for solving discrete optimization problems. For instance, for the minimum traveling salesman problem we establish bounds on the functionals for the symmetric problem with a value larger than (99.0–99.70) %; for the asymmetric problem, larger than (99.0–99.23) % (experimental estimates). Besides, we propose a different algorithm for the minimum traveling salesman problem that uses both two-index and single-index models.
Citation:
S. I. Sergeev, “Approximate algorithms for the traveling salesman problem. II”, Avtomat. i Telemekh., 2015, no. 3, 125–134; Autom. Remote Control, 76:3 (2015), 472–479
Linking options:
https://www.mathnet.ru/eng/at14202 https://www.mathnet.ru/eng/at/y2015/i3/p125
|
Statistics & downloads: |
Abstract page: | 341 | Full-text PDF : | 197 | References: | 50 | First page: | 32 |
|