TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES

被引：691
作者：
HELD, M
KARP, RM
机构：
来源：
OPERATIONS RESEARCH | 1970年 / 18卷 / 06期
关键词：
D O I：
10.1287/opre.18.6.1138
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：1138 / &
相关论文
共 17 条
[1]  
[Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393
[2]   TRAVELING SALESMAN PROBLEM - A SURVEY [J].
BELLMORE, M ;
NEHAUSE.GL .
OPERATIONS RESEARCH, 1968, 16 (03) :538-&
[3]   ON A LINEAR-PROGRAMMING, COMBINATORIAL APPROACH TO THE TRAVELING-SALESMAN PROBLEM [J].
DANTZIG, GB ;
FULKERSON, DR ;
JOHNSON, SM .
OPERATIONS RESEARCH, 1959, 7 (01) :58-66
[4]  
Dijkstra E.W., 1959, NUMER MATH, V1, P269, DOI [DOI 10.1007/BF01386390, /10.1007/BF01386390]
[5]   A NOTE ON THE MULTI-COMMODITY WAREHOUSE PROBLEM [J].
EASTMAN, WL .
MANAGEMENT SCIENCE, 1959, 5 (03) :327-331
[6]   OPTIMUM BRANCHINGS [J].
EDMONDS, J .
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04) :233-+
[7]  
EDMONDS J, TO BE PUBLISHED
[8]  
Gale D., 1968, J COMBIN THEORY, V4, P176
[9]   A LINEAR-PROGRAMMING APPROACH TO THE CUTTING STOCK PROBLEM .2. [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1963, 11 (06) :863-888
[10]   LINEAR + NONLINEAR METHODS IN PATTERN CLASSIFICATION [J].
GREENBERG, HJ ;
KONHEIM, AG .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1964, 8 (03) :299-&
12