|
Avtomatika i Telemekhanika, 2011, Issue 12, Pages 115–129
(Mi at3092)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
System Analysis and Operations Research
Method of scaling in approximate solution of the traveling salesman problem
E. E. Ivanko Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Yekaterinburg, Russia
Abstract:
An empirical algorithm to solve the traveling salesman problem was proposed. It is distinguished for the consecutive rational decomposition of the given task into subtasks of lower dimensions. Each subtask can be solved using any existing method, exact or empirical, including the recursively applied algorithm described in the present paper.
Citation:
E. E. Ivanko, “Method of scaling in approximate solution of the traveling salesman problem”, Avtomat. i Telemekh., 2011, no. 12, 115–129; Autom. Remote Control, 72:12 (2011), 2527–2540
Linking options:
https://www.mathnet.ru/eng/at3092 https://www.mathnet.ru/eng/at/y2011/i12/p115
|
Statistics & downloads: |
Abstract page: | 352 | Full-text PDF : | 141 | References: | 40 | First page: | 13 |
|