学术探索
学术期刊
新闻热点
数据分析
智能评审

THE TRAVELING SALESMAN PROBLEM - AN UPDATE OF RESEARCH

被引：21
作者：
PARKER, RG
RARDIN, RL
机构：
来源：
NAVAL RESEARCH LOGISTICS | 1983年 / 30卷 / 01期
关键词：
D O I：
10.1002/nav.3800300107
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：69 / 96
页数：28
相关论文
共 80 条
[1]   STRONG SUFFICIENT CONDITIONS FOR THE EXISTENCE OF HAMILTONIAN CIRCUITS IN UNDIRECTED GRAPHS [J].
AINOUCHE, A ;
CHRISTOFIDES, N .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 31 (03) :339-343
[2]  
[Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393
[3]  
[Anonymous], 1972, J COMB THEORY B, DOI DOI 10.1016/0095-8956(72)90020-2
[4]   A RESTRICTED LAGRANGEAN APPROACH TO THE TRAVELING SALESMAN PROBLEM [J].
BALAS, E ;
CHRISTOFIDES, N .
MATHEMATICAL PROGRAMMING, 1981, 21 (01) :19-46
[5]   TRAVELING SALESMAN PROBLEM - DUALITY APPROACH [J].
BAZARAA, MS ;
GOODE, JJ .
MATHEMATICAL PROGRAMMING, 1977, 13 (02) :221-237
[6]   TRAVELING SALESMAN PROBLEM - A SURVEY [J].
BELLMORE, M ;
NEHAUSE.GL .
OPERATIONS RESEARCH, 1968, 16 (03) :538-&
[7]   PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS [J].
BELLMORE, M ;
MALONE, JC .
OPERATIONS RESEARCH, 1971, 19 (02) :278-&
[8]  
Berge C., 1973, GRAPHS HYPERGRAPHS, V7
[9]  
BIXBY RE, 1978, MATH PROGRAMMING STU, V8
[10]  
Bondy J.A., 1969, STUDIA SCI MATH HUNG, V4, P473
12345678