This article is cited 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.

Presented by the member of Editorial Board: A. A. Lazarev

Received: 31.03.2010

 English version: Automation and Remote Control, 2011, 72:12, 2527–2540

Bibliographic databases:

• 
• 
• 
•