THE TRAVELING SALESMAN PROBLEM WITH MANY VISITS TO FEW CITIES

被引：25

作者：

COSMADAKIS, SS

PAPADIMITRIOU, CH

机构：

[1] MIT, Lab for Computer Science,, Cambridge, MA, USA, MIT, Lab for Computer Science, Cambridge, MA, USA

来源：

关键词：

D O I：

10.1137/0213007

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：99 / 108

页数：10

共 13 条

[1]

Christofides N., 1975, GRAPH THEORY ALGORIT

EDMONDS, J ;

KARP, RM .

[3]

Ford L. R., 1962, FLOWS NETWORKS

[4]

GILMORE PC, 1963, J OPER RES SOC AM, V11, P863

[5]

GILMORE PC, 1961, J OPER RES SOC AM, V9, P849

[6]

GILMORE PC, 1964, J OPER RES SOC AM, V12, P655

[7] A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS [J].

HELD, M ;

KARP, RM .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01) :196-210

[8]

KARP RM, 1979, SIAM J COMPUT, V8, P461

[9]

Kuhn H. W., 1956, NAV RES LOGIST Q, V3, P253, DOI [DOI 10.1002/NAV.3800030404, 10.1002/nav.3800030404, DOI 10.1002/NAV.38000304040143.42001]

[10]

Lawler E.L., 1976, COMBINATORIAL OPTIMI