Method of scaling in approximate solution of the traveling salesman problem

被引：0

作者：

E. E. Ivanko

机构：

[1] Russian Academy of Sciences,Institute of Mathematics and Mechanics, Ural Branch

来源：

Automation and Remote Control | 2011年 / 72卷

关键词：

Remote Control; Travel Salesman Problem; Travel Salesman Problem; Optimal Route; Radiation Hybrid;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用

页码：2527 / 2540

页数：13

共 18 条

[1]

Melamed I.I.(1989)The Traveling Salesman Problem. I. Theoretical Issues Autom. Remote Control 50 1147-1173

[2]

Sergeev S.I.(1971)One Generalization of the Traveling Salesman Problem. I Autom. Remote Control 32 1265-1271

[3]

Sigal I.Kh.(1989)The Traveling Salesman Problem. II. Exact Methods Autom. Remote Control 50 1303-1324

[4]

Sikharulidze G.G.(1989)The Traveling Salesman Problem. Approximate Algorithms Autom. Remote Control 50 1459-1479

[5]

Melamed I.I.(2008)Asymptotically Precise Algorithm to Seek One-edge and Two-edge Disjoint Routes of the Maximum Weight Traveling Salesman in the Euclidean Space Tr. Inst. Mat. Mekh., UrO Ross. Akad. Nauk 14 23-32

[6]

Sergeev S.I.(1999)Data Clustering: A Review ACM Computing Reviews 31 264-323

[7]

Sigal I.Kh.(1997)Estimating the Held-Karp Lower Bound for the Geometric TSP Eur. J. Oper. Res. 102 157-175

[8]

Melamed I.I.(1987)Optimization of a 532-City Symmetric Traveling Salesman Problem by Branch and Cut Oper. Res. 6 1-7

[9]

Sergeev S.I.(undefined)undefined undefined undefined undefined-undefined

[10]

Sigal I.Kh.(undefined)undefined undefined undefined undefined-undefined

← 1 2 →