A HEURISTIC ALGORITHM FOR THE TRAVELING SALESMAN LOCATION PROBLEM ON NETWORKS

被引：71

作者：

SIMCHILEVI, D ^{[1
]}

BERMAN, O ^{[1
]}

机构：

[1] UNIV MASSACHUSETTS,DEPT MANAGEMENT SCI,BOSTON,MA 02125

来源：

关键词：

D O I：

10.1287/opre.36.3.478

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：478 / 484

页数：7

共 10 条

[1]

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

[2] MINISUM LOCATION OF A TRAVELING SALESMAN [J].

BERMAN, O ;

LEVI, DS .

BERMAN, O ;

SIMCHILEVI, D .

[4]

Burness R. C., 1976, Transportation Science, V10, P348, DOI 10.1287/trsc.10.4.348

[5]

Christofides N., 2022, OPERATIONS RES FORUM, V3, DOI [10.1007/s43069-021-00101-z, DOI 10.1007/S43069-021-00101-Z]

[6]

Eilon S., 1971, DISTRIBUTION MANAGEM

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

FLOYD, RW .

[8]

HANDLER GY, 1979, LOCATION NETWORKS TH

[9]

JAILLET P, 1985, MIT185 OP RES CTR TE

[10]

SIMCHILEVI D, 1986, THESIS TEL AVIV U IS