RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Upravliaemie systemy,
1989
Issue 29,
Pages
11–15
(Mi da979)
The traveling salesman problem on a maximum: conditions for the asymptotic accuracy of the algorithm “go to the most remote city”
E. Kh. Gimadi
UDC:
519.854
Received:
18.07.1989
Fulltext:
PDF file (172 kB)
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2025