FINDING THE OPTIMAL A PRIORI TOUR AND LOCATION OF A TRAVELING SALESMAN WITH NONHOMOGENEOUS CUSTOMERS

被引：38

作者：

BERMAN, O ^{[1
]}

SIMCHILEVI, D ^{[1
]}

机构：

[1] COLUMBIA UNIV,NEW YORK,NY 10027

来源：

关键词：

D O I：

10.1287/trsc.22.2.148

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：148 / 154

页数：7

共 13 条

[1] MINISUM LOCATION OF A TRAVELING SALESMAN
BERMAN, O
LEVI, DS
[J]. NETWORKS, 1986, 16 (03) : 239 - 254
[2] BERMAN O, 1986, WP0886 U CALG FAC MA
[3] BURNESS RC, 1976, T SCI, V10, P35
[4] AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS
DREYFUS, SE
[J]. OPERATIONS RESEARCH, 1969, 17 (03) : 395 - &
[5] Eilon S., 1971, DISTRIBUTION MANAGEM
[6] A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS
HELD, M
KARP, RM
[J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01): : 196 - 210
[7] TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES
HELD, M
KARP, RM
[J]. OPERATIONS RESEARCH, 1970, 18 (06) : 1138 - &
[8] Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]
[9] JAILLET P, 1985, MIT185 OP RES CTR TE
[10] LAWLER E, 1963, MGMT SCI, V7, P586