INDUSTRIAL APPLICATION OF THE TRAVELING SALESMANS SUB-TOUR PROBLEM

被引：28

作者：

GENSCH, DH

机构：

来源：

AIIE TRANSACTIONS | 1978年 / 10卷 / 04期

关键词：

D O I：

10.1080/05695557808975227

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

引用

页码：362 / 370

页数：9

共 24 条

[1] TRAVELING SALESMAN PROBLEM - A SURVEY [J].

BELLMORE, M ;

NEHAUSE.GL .

OPERATIONS RESEARCH, 1968, 16 (03) :538-&

[2] PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS [J].

BELLMORE, M ;

MALONE, JC .

OPERATIONS RESEARCH, 1971, 19 (02) :278-&

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

CHRISTOFIDES, N .

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

[4] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].

CLARKE, G ;

WRIGHT, JW .

OPERATIONS RESEARCH, 1964, 12 (04) :568-&

[5]

DANTZIG GB, 1967, INT S THEORY GRAPHS, P77

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

EVERETT, H .

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

[7] SEARCHING FOR MULTIPLIER IN ONE-CONSTRAINT OPTIMIZATION PROBLEMS [J].

FOX, BL ;

LANDI, DM .

OPERATIONS RESEARCH, 1970, 18 (02) :253-+

[8]

Garfinkel R. S., 1972, INTEGER PROGRAMMING

[9]

GARFINKEL RS, 1973, OPERATIONS RES, V21, P240

[10]

GENSCH DH, 73076 U WISC SCH BUS

← 1 2 3 →