GENERALIZED TRAVELING SALESMAN PROBLEM THROUGH N-SETS OF NODES - THE ASYMMETRICAL CASE

被引：88

作者：

LAPORTE, G ^{[1
]}

MERCURE, H ^{[1
]}

NOBERT, Y ^{[1
]}

机构：

[1] UNIV QUEBEC,DEPT SCI ADM,MONTREAL H3C 3P8,QUEBEC,CANADA

来源：

DISCRETE APPLIED MATHEMATICS | 1987年 / 18卷 / 02期

关键词：

D O I：

10.1016/0166-218X(87)90020-5

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：185 / 197

页数：13

共 12 条

[1]

BOVET J, 1983, 6 EURO C VIENN

[2] SOME NEW BRANCHING AND BOUNDING CRITERIA FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM [J].

CARPANETO, G ;

TOTH, P .

MANAGEMENT SCIENCE, 1980, 26 (07) :736-743

[3] BOUNDS FOR TRAVELLING-SALESMAN PROBLEM [J].

CHRISTOFIDES, N .

OPERATIONS RESEARCH, 1972, 20 (05) :1044-+

[4]

HENRYLABORDERE AL, 1969, RIRO B, V2, P43

[5]

LAPORTE G, 1983, INFOR, V21, P61

[6]

LAPORTE G, 1984, RAIRO-RECH OPER, V18, P203

[7]

LAPORTE G, 1985, CONGRESSUS NUMERANTI, V48, P277

[8] COMPLEXITY OF VEHICLE-ROUTING AND SCHEDULING PROBLEMS [J].

LENSTRA, JK ;

KAN, AHGR .

NETWORKS, 1981, 11 (02) :221-227

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

LIN, S ;

KERNIGHAN, BW .

OPERATIONS RESEARCH, 1973, 21 (02) :498-516

[10]

ROUSSEAU JM, 1985, COMMUNICATION JAN

← 1 2 →