AN OPTIMAL SOLUTION METHOD FOR LARGE-SCALE MULTIPLE TRAVELING SALESMEN PROBLEMS

被引：80

作者：

GAVISH, B ^{[1
]}

SRIKANTH, K ^{[1
]}

机构：

[1] UNIV ILLINOIS,COLL BUSINESS ADM,CHICAGO,IL 60680

来源：

OPERATIONS RESEARCH | 1986年 / 34卷 / 05期

关键词：

D O I：

10.1287/opre.34.5.698

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：698 / 717

页数：20

共 40 条

[11] GENERALIZED LAGRANGE MULTIPLIER METHOD FOR SOLVING PROBLEMS OF OPTIMUM ALLOCATION OF RESOURCES [J].

EVERETT, H .

OPERATIONS RESEARCH, 1963, 11 (03) :399-417

[12] GOOD ALGORITHM FOR SMALLEST SPANNING TREES WITH A DEGREE CONSTRAINT [J].

GABOW, HN .

NETWORKS, 1978, 8 (03) :201-208

[13] EFFICIENT ALGORITHMS FOR SOLVING MULTICONSTRAINT ZERO-ONE KNAPSACK-PROBLEMS TO OPTIMALITY [J].

GAVISH, B ;

PIRKUL, H .

MATHEMATICAL PROGRAMMING, 1985, 31 (01) :78-105

[14] FORMULATION OF M-SALESMAN TRAVELING SALESMAN PROBLEM [J].

GAVISH, B .

MANAGEMENT SCIENCE, 1976, 22 (06) :704-705

[15] ZERO-ONE INTEGER PROGRAMS WITH FEW CONSTRAINTS - EFFICIENT BRANCH AND BOUND ALGORITHMS [J].

GAVISH, B ;

PIRKUL, H .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 22 (01) :35-43

[16] TOPOLOGICAL DESIGN OF CENTRALIZED COMPUTER-NETWORKS - FORMULATIONS AND ALGORITHMS [J].

GAVISH, B .

NETWORKS, 1982, 12 (04) :355-377

[17] FORMULATIONS AND ALGORITHMS FOR THE CAPACITATED MINIMAL DIRECTED TREE PROBLEM [J].

GAVISH, B .

JOURNAL OF THE ACM, 1983, 30 (01) :118-132

[18]

GAVISH B, 1983, QM8329 U ROCH GRAD S

[19]

GAVISH B, 1980, O N2 ALGORITHMS SENS

[20]

GAVISH B, 1979, MATH FORMULATIONS DI

← 1 2 3 4 →