THE PRODUCT MATRIX TRAVELING SALESMAN PROBLEM - AN APPLICATION AND SOLUTION HEURISTIC

被引:25
作者
PLANTE, RD [1 ]
LOWE, TJ [1 ]
CHANDRASEKARAN, R [1 ]
机构
[1] UNIV TEXAS DALLAS,OPERAT RES,RICHARDSON,TX 75080
关键词
D O I
10.1287/opre.35.5.772
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
8
引用
收藏
页码:772 / 783
页数:12
相关论文
共 8 条
[1]  
Christofides N., 1975, GRAPH THEORY ALGORIT
[2]   PARTITIONING FEASIBLE SET IN A BRANCH-AND-BOUND ALGORITHM FOR ASYMMETRIC TRAVELING-SALESMAN PROBLEM [J].
GARFINKEL, RS .
OPERATIONS RESEARCH, 1973, 21 (01) :340-343
[3]  
GILMORE PC, 1985, TRAVELING SALESMAN P, pCH4
[4]  
Hardy G. H., 1952, MATH GAZ
[5]  
Knuth Donald E, 1968, ART COMPUTER PROGRAM, V1
[6]  
PLANTE RA, 1963, Patent No. 3115711
[7]  
PLANTE RA, 1982, Patent No. 4327495
[8]  
PLANTE RD, 1985, PARTITIONING BALANCI