COMPUTATIONAL EXPERIENCE WITH AN M-SALESMAN TRAVELING SALESMAN ALGORITHM

被引：64

作者：

SVESTKA, JA

HUCKFELD.VE

机构：

[1] CLEVELAND TRUST CO,CLEVELAND,OH 44100

[2] WESTERN INTERSTATE COMM HIGHER EDUC,BOULDER,CO 80302

来源：

MANAGEMENT SCIENCE SERIES A-THEORY | 1973年 / 19卷 / 07期

关键词：

D O I：

10.1287/mnsc.19.7.790

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：790 / 799

页数：10

共 9 条

[1] TRAVELING SALESMAN PROBLEM - A SURVEY
BELLMORE, M
NEHAUSE.GL
[J]. OPERATIONS RESEARCH, 1968, 16 (03) : 538 - &
[2] PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS
BELLMORE, M
MALONE, JC
[J]. OPERATIONS RESEARCH, 1971, 19 (02) : 278 - &
[3] Conway R, 1967, THEORY SCHEDULING
[4] EASTMAN WL, 1958, THESIS HARVARD
[5] Ford Lester R., 1962, FLOWS NETWORKS
[6] LITTLE JDC, 1963, OPER RES, V11, P979
[7] INTEGER PROGRAMMING FORMULATION OF TRAVELING SALESMAN PROBLEMS
MILLER, CE
TUCKER, AW
ZEMLIN, RA
[J]. JOURNAL OF THE ACM, 1960, 7 (04) : 326 - 329
[8] SHAPIRO DM, 1966, THESIS WASHINGTON U
[9] Wagner HM, 1969, PRINCIPLES OPERATION