|
Avtomatika i Telemekhanika, 2009, Issue 11, Pages 148–160
(Mi at562)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Simulation of Behavior and Intelligence
The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal $2$-matching
S. I. Sergeev Moscow State University of Economics, Statistics and Informatics
Abstract:
To solve the symmetric travelling salesman problem we suggest a lower bound – the solution of an optimal $2$-matching problem. The latter problem is solved (in a polynomial number of steps) not completely, but up to obtaining new stable lower bounds.
Citation:
S. I. Sergeev, “The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal $2$-matching”, Avtomat. i Telemekh., 2009, no. 11, 148–160; Autom. Remote Control, 70:11 (2009), 1901–1912
Linking options:
https://www.mathnet.ru/eng/at562 https://www.mathnet.ru/eng/at/y2009/i11/p148
|
Statistics & downloads: |
Abstract page: | 418 | Full-text PDF : | 201 | References: | 64 | First page: | 9 |
|