TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES

被引：681

|

作者：

HELD, M

KARP, RM

机构：

来源：

OPERATIONS RESEARCH | 1970年 / 18卷 / 06期

关键词：

D O I：

10.1287/opre.18.6.1138

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：1138 / &

相关论文

共 50 条

[21] NORMA - A POSSIBLE BASIS FOR A THEORY FOR TRAVELING-SALESMAN PROBLEM
SALZ, NP
OPERATIONS RESEARCH, 1965, S 13 : B74 - &
[22] TRAVELING SALESMAN PROBLEM COMPLEXITY INDEXES BASED ON MINIMAL SPANNING-TREES
CVETKOVIC, D
DIMITRIJEVIC, V
MILOSAVLJEVIC, M
GRAPH THEORY, 1989, : 43 - 51
[23] Solving the traveling-salesman problem by a statistical-physics method
Yoshiyuki, Usami
Yoshiki, Kano
Masatoshi, Kitaoka
Computers in Physics, 1996, 10 (06):
[24] Solution for a bipartite Euclidean traveling-salesman problem in one dimension
Caracciolo, Sergio
Di Gioacchino, Andrea
Gherardi, Marco
Malatesta, Enrico M.
PHYSICAL REVIEW E, 2018, 97 (05)
[25] Traveling-Salesman Problem for a Class of Carrier-Vehicle Systems
Garone, Emanuele
Naldi, Roberto
Casavola, Alessandro
JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 2011, 34 (04) : 1272 - 1276
[26] A PARALLEL 2-OPT ALGORITHM FOR THE TRAVELING-SALESMAN PROBLEM
VERHOEVEN, MGA
AARTS, EHL
SWINKELS, PCJ
FUTURE GENERATION COMPUTER SYSTEMS, 1995, 11 (02) : 175 - 182
[27] WHEN IS THE ASSIGNMENT BOUND TIGHT FOR THE ASYMMETRIC TRAVELING-SALESMAN PROBLEM
FRIEZE, A
KARP, RM
REED, B
SIAM JOURNAL ON COMPUTING, 1995, 24 (03) : 484 - 493
[28] A BOUND FOR THE SYMMETRICAL TRAVELING-SALESMAN PROBLEM THROUGH MATROID FORMULATION
COWLING, P
MAFFIOLI, F
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 83 (02) : 301 - 309
[29] A MODIFICATION OF THE DYNAMIC-PROGRAMMING METHOD FOR THE TRAVELING-SALESMAN PROBLEM
KOROTAYEVA, LN
SESEKIN, AN
CHENTSOV, AG
USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1989, 29 (04): : 96 - 100
[30] ON A LINEAR-PROGRAMMING, COMBINATORIAL APPROACH TO THE TRAVELING-SALESMAN PROBLEM
DANTZIG, GB
FULKERSON, DR
JOHNSON, SM
OPERATIONS RESEARCH, 1959, 7 (01) : 58 - 66

← 1 2 3 4 5 →