THE TRAVELING-SALESMAN PROBLEM

被引：392

|

作者：

FLOOD, MM

机构：

来源：

OPERATIONS RESEARCH | 1956年 / 4卷 / 01期

关键词：

D O I：

10.1287/opre.4.1.61

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：61 / 75

页数：15

相关论文

共 50 条

[31] Solving the traveling-salesman problem with time windows using tabu search
Carlton, W.B.
Barnes, J.W.
IIE Transactions (Institute of Industrial Engineers), 1996, 28 (08): : 617 - 629
[32] Quantum speedup of the traveling-salesman problem for bounded-degree graphs
Moylett, Dominic J.
Linden, Noah
Montanaro, Ashley
PHYSICAL REVIEW A, 2017, 95 (03)
[33] COMPUTATIONAL IMPLEMENTATION OF A COMBINED BRANCH AND BOUND ALGORITHM FOR THE TRAVELING-SALESMAN PROBLEM
SIGAL, IK
USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1986, 26 (03): : 14 - 19
[34] Reusing the NP-Hard Traveling-Salesman Problem to Demonstrate that P∼NP
Rubin, Stuart H.
Bouabana-Tebibel, Thouraya
Hoadjli, Yasmin
Ghalem, Zahira
PROCEEDINGS OF 2016 IEEE 17TH INTERNATIONAL CONFERENCE ON INFORMATION REUSE AND INTEGRATION (IEEE IRI), 2016, : 574 - 581
[35] SOME PROPERTIES OF THE SOLUTION SPACE OF THE N-CITY TRAVELING-SALESMAN PROBLEM
FEIRING, BR
APPLIED MATHEMATICS AND COMPUTATION, 1987, 23 (04) : 291 - 340
[36] GENERATING TRAVELING-SALESMAN PROBLEMS WITH KNOWN OPTIMAL TOURS
ARTHUR, JL
FRENDEWEY, JO
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (02) : 153 - 159
[37] PARTITIONING FEASIBLE SET IN A BRANCH-AND-BOUND ALGORITHM FOR ASYMMETRIC TRAVELING-SALESMAN PROBLEM
GARFINKEL, RS
OPERATIONS RESEARCH, 1973, 21 (01) : 340 - 343
[38] A MODIFIED LIN-KERNIGHAN TRAVELING-SALESMAN HEURISTIC
MAK, KT
MORTON, AJ
OPERATIONS RESEARCH LETTERS, 1993, 13 (03) : 127 - 132
[39] PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS
BELLMORE, M
MALONE, JC
OPERATIONS RESEARCH, 1971, 19 (02) : 278 - &
[40] UTILIZING TRAVELING-SALESMAN SUBTOURS TO CREATE SALES DISTRICTS
FEIRING, BR
ENGINEERING COSTS AND PRODUCTION ECONOMICS, 1986, 10 (03): : 211 - 215

← 1 2 3 4 5 →