APPROXIMATE TRAVELING SALESMAN ALGORITHMS

被引：164
作者：
GOLDEN, B
BODIN, L
DOYLE, T
STEWART, W
机构：
来源：
OPERATIONS RESEARCH | 1980年 / 28卷 / 03期
关键词：
D O I：
10.1287/opre.28.3.694
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：694 / 711
页数：18
相关论文
共 50 条
[21]   Solving traveling salesman problems by genetic algorithms [J].
LEE Heow Pueh ;
LIM Siak Piang ;
LEE Kwok Hong .
ProgressinNaturalScience, 2003, (02) :57-63
[22]   Method of scaling in approximate solution of the traveling salesman problem [J].
Ivanko, E. E. .
AUTOMATION AND REMOTE CONTROL, 2011, 72 (12) :2527-2540
[23]   The Quantum Approximate Algorithm for Solving Traveling Salesman Problem [J].
Ruan, Yue ;
Marsh, Samuel ;
Xue, Xilin ;
Liu, Zhihao ;
Wang, Jingbo .
CMC-COMPUTERS MATERIALS & CONTINUA, 2020, 63 (03) :1237-1247
[24]   Exact and Approximate Stability of Solutions to Traveling Salesman Problems [J].
Niendorf, Moritz ;
Girard, Anouck R. .
IEEE TRANSACTIONS ON CYBERNETICS, 2018, 48 (02) :583-595
[25]   BRANCH AND BOUND ALGORITHMS - TRAVELING SALESMAN PROBLEM [J].
PARSONS, JA .
JOURNAL OF SYSTEMS MANAGEMENT, 1969, 20 (08) :38-40
[26]   Competitive algorithms for the on-line traveling salesman [J].
Ausiello, G ;
Feuerstein, E ;
Leonardi, S ;
Stougie, L ;
Talamo, M .
ALGORITHMS AND DATA STRUCTURES, 1995, 955 :206-217
[27]   ON SOLVING TRAVELING SALESMAN PROBLEMS BY GENETIC ALGORITHMS [J].
BRAUN, H .
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 496 :129-133
[28]   Solving traveling salesman problems by genetic algorithms [J].
Liang, YC ;
Ge, HW ;
Zhou, CG ;
Lee, HP ;
Lin, WZ ;
Lim, SP ;
Lee, KH .
PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2003, 13 (02) :135-141
[29]   ALGORITHMS FOR SOLVING BOTTLENECK TRAVELING SALESMAN PROBLEMS [J].
SMITH, THC ;
THOMPSON, GL .
OPERATIONS RESEARCH, 1975, 23 :B283-B283
[30]   Exact algorithms for the Equitable Traveling Salesman Problem [J].
Kinable, Joris ;
Smeulders, Bart ;
Delcour, Eline ;
Spieksma, Frits C. R. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 261 (02) :475-485
12345