Method of scaling in approximate solution of the traveling salesman problem
Evgeny Ivanko · Automation and Remote Control · 2011
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.