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 条
[31]   A MULTIPERIOD TRAVELING SALESMAN PROBLEM - HEURISTIC ALGORITHMS [J].
PALETTA, G .
COMPUTERS & OPERATIONS RESEARCH, 1992, 19 (08) :789-795
[32]   Automatic design of algorithms for the traveling salesman problem [J].
Loyola, Cristian ;
Sepulveda, Mauricio ;
Solar, Mauricio ;
Lopez, Pierre ;
Parada, Victor .
COGENT ENGINEERING, 2016, 3 (01)
[33]   EFFECTIVE NEURAL ALGORITHMS FOR THE TRAVELING SALESMAN PROBLEM [J].
XU, X ;
TSAI, WT .
NEURAL NETWORKS, 1991, 4 (02) :193-205
[34]   Interactive genetic algorithms for the traveling salesman problem [J].
Louis, SJ ;
Tang, R .
GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 1999, :385-392
[35]   DISTINCT MULTI-SALESMAN TRAVELING SALESMAN PROBLEM - STRUCTURE, ALGORITHMS AND APPLICATIONS [J].
MARSH, JD .
OPERATIONS RESEARCH, 1975, 23 :B325-B325
[36]   Field partitioning: An approximate method for the solution of the traveling salesman problem [J].
Bapat, PM ;
Takalikar, SN .
FIRST INTERNATIONAL CONFERENCE ON OPERATIONS AND QUANTITATIVE MANAGEMENT, VOL 1 AND 2, 1997, :71-75
[37]   A membrane-inspired approximate algorithm for traveling salesman problems [J].
Zhang, Gexiang ;
Cheng, Jixiang ;
Gheorghe, Marian .
ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 2011, 14 (01) :3-19
[38]   RAPID HEURISTIC ALGORITHM FOR APPROXIMATE SOLUTION OF TRAVELING SALESMAN PROBLEM [J].
WIORKOWSKI, JJ ;
MCELVAIN, K .
TRANSPORTATION RESEARCH, 1975, 9 (2-3) :181-185
[39]   Fast agglomerative clustering using approximate traveling salesman solutions [J].
Sieranoja, Sami ;
Franti, Pasi .
JOURNAL OF BIG DATA, 2025, 12 (01)
[40]   Approximate fair cost allocation in metric traveling salesman games [J].
Bläser, M ;
Ram, LS .
APPROXIMATION AND ONLINE ALGORITHMS, 2006, 3879 :82-95
12345