SOME EXAMPLES OF DIFFICULT TRAVELING SALESMAN PROBLEMS

被引：42

作者：

PAPADIMITRIOU, CH ^{[1
]}

STEIGLITZ, K ^{[1
]}

机构：

[1] PRINCETON UNIV,PRINCETON,NJ 08540

来源：

关键词：

D O I：

10.1287/opre.26.3.434

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：434 / 443

页数：10

共 13 条

[1]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[2] TRAVELING SALESMAN PROBLEM - A SURVEY [J].

BELLMORE, M ;

NEHAUSE.GL .

[3]

BOCK F, 1958, 14TH NAT M OP RES SO

[4]

CHRISTOFIDES N, 1976, APR CARN MELL C ALG

[5] A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS [J].

CROES, GA .

[6] ALGORITHM-97 - SHORTEST PATH [J].

FLOYD, RW .

[7]

Karp Richard M., 1972, COMPLEXITY COMPUTER, P85

[8] COMPUTER SOLUTIONS OF TRAVELING SALESMAN PROBLEM [J].

LIN, S .

BELL SYSTEM TECHNICAL JOURNAL, 1965, 44 (10) :2245-+

[9] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM [J].

LIN, S ;

KERNIGHAN, BW .

[10]

Papadimitriou C. H., 1977, SIAM Journal on Computing, V6, P76, DOI 10.1137/0206005