A FAST ALGORITHM FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM, OPTIMAL WITH PROBABILITY ONE

被引：20

作者：

HALTON, JH ^{[1
]}

TERADA, R ^{[1
]}

机构：

[1] UNIV SAO PAULO,INST MATEMATICA & ESTATISTICA,SAO PAULO,BRAZIL

来源：

关键词：

D O I：

10.1137/0211003

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：28 / 46

页数：19

共 10 条

[1]

Beardwood J, 1959, P CAMBRIDGE PHILOS S, V55, P299, DOI [DOI 10.1017/S0305004100034095, 10.1017/S0305004100034095]

[2] DYNAMIC PROGRAMMING TREATMENT OF TRAVELLING SALESMAN PROBLEM [J].

BELLMAN, R .

[3]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[4]

GAREY MR, 1976, 8TH P ANN ACM S THEO, P10

[5]

HALTON JH, 1978, 335 U WISC COMP SCI

[6]

HELD M, 1962, SIAM J, V10, P196

[7]

Karp R. M., 1977, Mathematics of Operations Research, V2, P209, DOI 10.1287/moor.2.3.209

[8]

KROLAK PD, 1970, 7TH P INT S MATH PRO

[9]

LIN S, 1973, J OPER RES, V21, P498

[10]

Papadimitriou C. H., 1977, Theoretical Computer Science, V4, P237, DOI 10.1016/0304-3975(77)90012-3