BOTTLENECK TRAVELING SALESMAN PROBLEM - ALGORITHMS AND PROBABILISTIC ANALYSIS

被引：29

作者：

GARFINKEL, RS ^{[1
]}

GILBERT, KC ^{[1
]}

机构：

[1] TENNESSEE VALLEY AUTHOR,KNOXVILLE,TN 37902

来源：

关键词：

D O I：

10.1145/322077.322086

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：435 / 448

页数：14

共 17 条

[1] PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS
BELLMORE, M
MALONE, JC
[J]. OPERATIONS RESEARCH, 1971, 19 (02) : 278 - &
[2] Berge C., 1973, GRAPHS HYPERGRAPHS
[3] Edmonds J., 1970, J COMB THEORY, V8, P299, DOI DOI 10.1016/S0021-9800(70)80083-7
[4] Ford Lester R., 1962, FLOWS NETWORKS
[5] FRANCIS RL, 1974, FACILITY LAYOUT LOCA, pCH9
[6] PARTITIONING FEASIBLE SET IN A BRANCH-AND-BOUND ALGORITHM FOR ASYMMETRIC TRAVELING-SALESMAN PROBLEM
GARFINKEL, RS
[J]. OPERATIONS RESEARCH, 1973, 21 (01) : 340 - 343
[7] BOTTLENECK TRANSPORTATION PROBLEM
GARFINKEL, RS
RAO, MR
[J]. NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (04): : 465 - +
[8] IMPROVED ALGORITHM FOR BOTTLENECK ASSIGNMENT PROBLEM
GARFINKEL, RS
[J]. OPERATIONS RESEARCH, 1971, 19 (07) : 1747 - +
[9] GARFINKEL RS, 1970, MANAGE SCI, V16, P495
[10] GILBERT KC, 1976, THESIS U TENNESSEE