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 条
[41]   An approximate method to compute a sparse graph for traveling salesman problem [J].
Wang, Yong .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (12) :5150-5162
[42]   Comparative Solutions of Exact and Approximate Methods for Traveling Salesman Problem [J].
Chandra, Agung ;
Natalia, Christine ;
Naro, Aulia .
REVISTA DIGITAL LAMPSAKOS, 2021, (25) :1-12
[43]   New heuristic algorithms for the Dubins traveling salesman problem [J].
Babel, Luitpold .
JOURNAL OF HEURISTICS, 2020, 26 (04) :503-530
[44]   ON PATCHING ALGORITHMS FOR RANDOM ASYMMETRIC TRAVELING SALESMAN PROBLEMS [J].
DYER, ME ;
FRIEZE, AM .
MATHEMATICAL PROGRAMMING, 1990, 46 (03) :361-378
[45]   BOTTLENECK TRAVELING SALESMAN PROBLEM - ALGORITHMS AND PROBABILISTIC ANALYSIS [J].
GARFINKEL, RS ;
GILBERT, KC .
JOURNAL OF THE ACM, 1978, 25 (03) :435-448
[46]   Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem [J].
An, Hyung-Chan ;
Kleinberg, Robert D. ;
Shmoys, David B. .
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 :1-+
[47]   Approximation algorithms for the traveling salesman problem with range condition [J].
Kumar, DA ;
Rangan, CP .
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (03) :173-181
[48]   Solving constrained traveling salesman problems by genetic algorithms [J].
WU Chunguo LIANG Yanchun LEE Heowpueh LU Chun and LIN Wuzhong College of Computer Science and Technology Jilin University ;
Key Laboratory for Symbol Computation and Knowledge Engineering Ministry of Education of China Changchun China Institute of High Performance Computing Singapore Singapore .
ProgressinNaturalScience, 2004, (07) :79-85
[49]   A note on approximation algorithms of the clustered traveling salesman problem [J].
Bao, Xiaoguang ;
Liu, Zhaohui ;
Yu, Wei ;
Li, Ganggang .
INFORMATION PROCESSING LETTERS, 2017, 127 :54-57
[50]   Solving constrained traveling salesman problems by genetic algorithms [J].
Wu, CG ;
Liang, YC ;
Lee, HP ;
Lu, C ;
Lin, WZ .
PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2004, 14 (07) :631-637
12345