TRAVELING SALESMAN PROBLEM - A SURVEY

被引:279
作者
BELLMORE, M
NEHAUSE.GL
机构
关键词
D O I
10.1287/opre.16.3.538
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:538 / &
相关论文
共 41 条
[1]  
ACKOFF RL, PROGRESS OPERATIO ED, V1, P150
[2]  
[Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393
[3]  
ARNOFF EL, PROGRESS OPERATION R, V1, P150
[4]   AN ADDITIVE ALGORITHM FOR SOLVING LINEAR PROGRAMS WITH 0-1 VARIABLES [J].
BALAS, E .
OPERATIONS RESEARCH, 1965, 13 (04) :517-&
[5]   GRAPHIC SOLUTION OF THE TRAVELING-SALESMAN PROBLEM [J].
BARACHET, LL .
OPERATIONS RESEARCH, 1957, 5 (06) :841-845
[6]  
Beardwood J, 1959, P CAMBRIDGE PHILOS S, V55, P299, DOI [DOI 10.1017/S0305004100034095, 10.1017/S0305004100034095]
[7]   DYNAMIC PROGRAMMING TREATMENT OF TRAVELLING SALESMAN PROBLEM [J].
BELLMAN, R .
JOURNAL OF THE ACM, 1962, 9 (01) :61-&
[8]  
BOCK F, RECENT ADVANCES MATH, P339
[9]   A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS [J].
CROES, GA .
OPERATIONS RESEARCH, 1958, 6 (06) :791-812
[10]   SELECTION OF AN INITIAL SOLUTION FOR THE TRAVELING-SALESMAN PROBLEM [J].
DACEY, MF .
OPERATIONS RESEARCH, 1960, 8 (01) :133-134