COMPUTATIONAL STUDY OF AN IMPROVED SHORTEST-PATH ALGORITHM

被引：30

作者：

GLOVER, F ^{[1
]}

GLOVER, R ^{[1
]}

KLINGMAN, D ^{[1
]}

机构：

[1] UNIV TEXAS,DEPT GEN BUSINESS,AUSTIN,TX 78712

来源：

NETWORKS | 1984年 / 14卷 / 01期

关键词：

D O I：

10.1002/net.3230140103

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：25 / 36

页数：12

共 13 条

[1] SHORTEST-ROUTE METHODS .1. REACHING, PRUNING, AND BUCKETS [J].

DENARDO, EV ;

FOX, BL .

OPERATIONS RESEARCH, 1979, 27 (01) :161-186

[2] COMPUTATIONAL ANALYSIS OF ALTERNATIVE ALGORITHMS AND LABELING TECHNIQUES FOR FINDING SHORTEST PATH TREES [J].

DIAL, R ;

GLOVER, F ;

KARNEY, D ;

KLINGMAN, D .

NETWORKS, 1979, 9 (03) :215-248

[3] AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J].

DREYFUS, SE .

OPERATIONS RESEARCH, 1969, 17 (03) :395-&

[4] A DUAL SIMPLEX ALGORITHM FOR FINDING ALL SHORTEST PATHS [J].

FLORIAN, M ;

NGUYEN, S ;

PALLOTTINO, S .

NETWORKS, 1981, 11 (04) :367-378

[5] A NEW ALGORITHM TO FIND THE SHORTEST PATHS BETWEEN ALL PAIRS OF NODES [J].

GALLO, G ;

PALLOTTINO, S .

DISCRETE APPLIED MATHEMATICS, 1982, 4 (01) :23-35

[6]

GILSINN J, 1973, NBS772 US DEP COMM T

[7]

GLOVER F, 1982, PARTITIONING SHORTES, P10

[8] SHORTEST-PATH ALGORITHMS - COMPARISON [J].

GOLDEN, B .

OPERATIONS RESEARCH, 1976, 24 (06) :1164-1168

[9]

HU T, 1972, SIAM J APPL MATH, V15, P510

[10]

JOHNSON EL, 1972, 25TH P ACM ANN C, P510

← 1 2 →