SOME SIMPLE APPLICATIONS OF TRAVELING SALESMAN PROBLEM

被引：168

作者：

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 条

[31] SHORTEST CONNECTION NETWORKS AND SOME GENERALIZATIONS [J].

PRIM, RC .

BELL SYSTEM TECHNICAL JOURNAL, 1957, 36 (06) :1389-1401

[32] SCHEDULING PROBLEM [J].

REDDI, SS ;

RAMAMOORTHY, CV .

OPERATIONAL RESEARCH QUARTERLY, 1973, 24 (03) :441-446

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

REDDI, SS ;

RAMAMOOR.CV .

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

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

REDDI, SS ;

RAMAMOORTHY, CV .

OPERATIONAL RESEARCH QUARTERLY, 1972, 23 (03) :323-+

[35]

RINNOOYKAN AHG, R734 GRAD SCH MAN DE

[36]

RINNOOYKAN AHG, 1973, BW27 MATH CTR AMST R

[37]

ROES AW, UNPUBLISHED REPORT

[38]

SYSLO MM, 1974, ZASTOSOW MAT, V14, P93

[39]

VANDEMAN JM, 1974, AIIE T, V6, P28

[40]

VISSCHERS J, 1973, SO1 I KERNPH OND REP

← 1 2 3 4 5 →