SOLUTION OF TRAVELING SALESMAN PROBLEM BY 4-OPT METHOD

被引:0
作者
KUO, SS
LINGEMAN, JC
机构
关键词
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:479 / &
相关论文
共 50 条
[21]   On the solution of the traveling salesman problem once again [J].
Parkhomenko, P. P. .
AUTOMATION AND REMOTE CONTROL, 2006, 67 (12) :2036-2050
[22]   New results on the old k-opt algorithm for the traveling salesman problem [J].
Chandra, B ;
Karloff, H ;
Tovey, C .
SIAM JOURNAL ON COMPUTING, 1999, 28 (06) :1998-2029
[23]   THE APPROXIMATION RATIO OF THE k-OPT HEURISTIC FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM [J].
Brodowsky, Ulrich A. ;
Hougardy, Stefan ;
Zhong, Xianghui .
SIAM JOURNAL ON COMPUTING, 2023, 52 (04) :841-864
[24]   Graph attention, learning 2-opt algorithm for the traveling salesman problem [J].
Luo, Jia ;
Heng, Herui ;
Wu, Geng .
COMPLEX & INTELLIGENT SYSTEMS, 2025, 11 (01)
[25]   The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem [J].
Hougardy, Stefan ;
Zaiser, Fabian ;
Zhong, Xianghui .
OPERATIONS RESEARCH LETTERS, 2020, 48 (04) :401-404
[26]   The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem [J].
Brodowsky, Ulrich A. ;
Hougardy, Stefan .
38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
[28]   A METHOD FOR ANALYZING SOLUTION SPACE OF TRAVELING SALESMAN PROBLEM BASED ON COMPLEX NETWORK [J].
Rao, Weizhen ;
Jin, Chun .
INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2013, 9 (09) :3685-3700
[29]   ABOUT OF THE ANNEALING METHOD USING FOR THE TRAVELING SALESMAN PROBLEM SOLUTION WITH THE FUZZY TIME [J].
Ivohin, E. V. ;
Adzhubey, L. T. ;
Makhno, M. F. ;
Rets, V. O. .
RADIO ELECTRONICS COMPUTER SCIENCE CONTROL, 2024, (04) :56-63
[30]   THE CAVITY METHOD AND THE TRAVELING-SALESMAN PROBLEM [J].
KRAUTH, W ;
MEZARD, M .
EUROPHYSICS LETTERS, 1989, 8 (03) :213-218