A FAST ALGORITHM FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM, OPTIMAL WITH PROBABILITY ONE

被引：21
|
作者：
HALTON, JH [1 ]
TERADA, R [1 ]
机构：
[1] UNIV SAO PAULO,INST MATEMATICA & ESTATISTICA,SAO PAULO,BRAZIL
来源：
SIAM JOURNAL ON COMPUTING | 1982年 / 11卷 / 01期
关键词：
D O I：
10.1137/0211003
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：28 / 46
页数：19
相关论文
共 50 条
  • [1] AN ALGORITHM FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WHICH IS OPTIMAL WITH PROBABILITY ONE
    TERADA, R
    [J]. ANAIS DA ACADEMIA BRASILEIRA DE CIENCIAS, 1981, 53 (03): : 625 - 625
  • [2] A Hybrid Heuristic Algorithm for the Euclidean Traveling Salesman Problem
    Singh, Dharm Raj
    Singh, Manoj Kumar
    Singh, Tarkeshwar
    [J]. 2015 INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION & AUTOMATION (ICCCA), 2015, : 773 - 778
  • [3] A fast evolutionary algorithm for traveling salesman problem
    Yan, Xue-Song
    Liu, Han-Min
    Yan, Jia
    Wu, Qing-Hua
    [J]. ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 4, PROCEEDINGS, 2007, : 85 - +
  • [4] A Near Optimal Approach for Symmetric Traveling Salesman Problem in Euclidean Space
    Tian, Wenhong
    Huang, Chaojie
    Wang, Xinyang
    [J]. PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES), 2017, : 281 - 287
  • [5] A Fast Parallel Genetic Algorithm for Traveling Salesman Problem
    Tsai, Chun-Wei
    Tseng, Shih-Pang
    Chiang, Ming-Chao
    Yang, Chu-Sing
    [J]. METHODS AND TOOLS OF PARALLEL PROGRAMMING MULTICOMPUTERS, 2010, 6083 : 241 - +
  • [6] Solution for a bipartite Euclidean traveling-salesman problem in one dimension
    Caracciolo, Sergio
    Di Gioacchino, Andrea
    Gherardi, Marco
    Malatesta, Enrico M.
    [J]. PHYSICAL REVIEW E, 2018, 97 (05)
  • [7] Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
    Marinakis, Yannis
    Marinaki, Magdalene
    Dounias, Georgios
    [J]. INFORMATION SCIENCES, 2011, 181 (20) : 4684 - 4698
  • [8] Optimal algorithm for the traveling salesman problem with time windows
    Dumas, Yvan
    Desrosiers, Jacques
    Gelinas, Eric
    Solomon, Marius M.
    [J]. Operations Research, 1995, 43 (02)
  • [9] AN OPTIMAL ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS
    DUMAS, Y
    DESROSIERS, J
    GELINAS, E
    SOLOMON, MM
    [J]. OPERATIONS RESEARCH, 1995, 43 (02) : 367 - 371
  • [10] The noisy Euclidean traveling salesman problem and learning
    Braun, ML
    Buhmann, JM
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 14, VOLS 1 AND 2, 2002, 14 : 351 - 358
12345