AN IMPROVED SOLUTION TO THE TRAVELING SALESMAN PROBLEM WITH THOUSANDS OF NODES

被引：23
|
作者：
LITKE, JD
机构：
来源：
COMMUNICATIONS OF THE ACM | 1984年 / 27卷 / 12期
关键词：
D O I：
10.1145/2135.2141
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：1227 / 1236
页数：10
相关论文
共 50 条
  • [1] A NATURAL SOLUTION TO THE TRAVELING SALESMAN PROBLEM
    AMIN, S
    FERNANDEZVILLACANAS, JL
    COCHRANE, P
    BRITISH TELECOMMUNICATIONS ENGINEERING, 1994, 13 : 117 - 122
  • [2] APPROXIMATE SOLUTION OF THE TRAVELING SALESMAN PROBLEM
    Dulkeyt, V., I
    Faizulin, R. T.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2009, 3 (01): : 72 - +
  • [3] An optical solution for the traveling salesman problem
    Haist, Tobias
    Osten, Wolfgang
    OPTICS EXPRESS, 2007, 15 (16) : 10473 - 10482
  • [4] A SUFFICIENCY SOLUTION OF TRAVELING SALESMAN PROBLEM
    ASH, M
    STAUDHAM.J
    OPERATIONS RESEARCH, 1966, S 14 : B70 - &
  • [5] A SOLUTION TO THE TRAVELING-SALESMAN PROBLEM
    EASTMAN, WL
    ECONOMETRICA, 1959, 27 (02) : 282 - 282
  • [6] Solving traveling salesman problem on cluster compute nodes
    Aziz, Izzatdin A.
    Haron, Nazleeni
    Mehat, Mazlina
    Jung, Low Tan
    Mustapa, Aisyah Nabilah
    Akir, Emelia Akashah Patah
    WSEAS Transactions on Computers, 2009, 8 (06): : 1020 - 1029
  • [7] An Improved Hybrid Algorithm for Traveling Salesman Problem
    Bai, Qiuying
    Li, Guizhi
    Sun, Qiheng
    2015 8TH INTERNATIONAL CONFERENCE ON BIOMEDICAL ENGINEERING AND INFORMATICS (BMEI), 2015, : 806 - 809
  • [8] IMPROVED LOWER BOUNDS TO THE TRAVELING SALESMAN PROBLEM
    DATRI, G
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1978, 12 (04): : 369 - 382
  • [9] An improved genetic algorithm for the traveling salesman problem
    Li, Lijie
    Zhang, Ying
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF CONTEMPORARY INTELLIGENT COMPUTING TECHNIQUES, 2007, 2 : 208 - +
  • [10] An improved heuristic for the period traveling salesman problem
    Bertazzi, L
    Paletta, G
    Speranza, MG
    COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (08) : 1215 - 1222
12345