SOME SIMPLE APPLICATIONS OF TRAVELING SALESMAN PROBLEM

被引：163

作者：

LENSTRA, JK

RINNOOYKAN, AHG

机构：

[1] MATH CTR,AMSTERDAM,NETHERLANDS

[2] GRAD SCH MANAGEMENT DELFT,DELFT,NETHERLANDS

来源：

OPERATIONAL RESEARCH QUARTERLY | 1975年 / 26卷 / 04期

关键词：

D O I：

10.2307/3008306

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：717 / 733

页数：17

共 41 条

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

BELLMORE, M ;

NEHAUSE.GL .

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

[2]

BELLMORE M, 1971, OPER RES, V19, P1766, DOI 10.1287/opre.19.7.1766

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

BELLMORE, M ;

MALONE, JC .

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

[4]

BRUCKER P, 1975, BW43 MATH CTR AMST R

[5] ALGORITHMS FOR LARGE-SCALE TRAVELLING SALESMAN PROBLEMS [J].

CHRISTOFIDES, N ;

EILON, S .

OPERATIONAL RESEARCH QUARTERLY, 1972, 23 (04) :511-+

[6]

Dijkstra E., 1959, NUMER MATH, V1, P269

[7]

Eilon S., 1971, DISTRIBUTION MANAGEM

[8]

FLORIAN M, 1971, MANAGE SCI B-APPL, V17, pB782

[9] FLOW-SHOP SEQUENCING PROBLEM WITH NO WAIT IN PROCESS [J].

GOYAL, SK .

OPERATIONAL RESEARCH QUARTERLY, 1973, 24 (01) :130-133

[10]

GRABOWSKI J, 1973, ZASTOS MAT, V13, P339

← 1 2 3 4 5 →