A COMPUTATIONAL STUDY OF EFFICIENT SHORTEST-PATH ALGORITHMS

被引：37

作者：

HUNG, MS ^{[1
]}

DIVOKY, JJ ^{[1
]}

机构：

[1] UNIV AKRON,COLL BUSINESS ADM,AKRON,OH 44325

来源：

COMPUTERS & OPERATIONS RESEARCH | 1988年 / 15卷 / 06期

关键词：

D O I：

10.1016/0305-0548(88)90052-4

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

引用

页码：567 / 576

页数：10

共 21 条

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

DENARDO, EV ;

FOX, BL .

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

[2] A SHORTEST AUGMENTING PATH METHOD FOR SOLVING MINIMAL PERFECT MATCHING PROBLEMS [J].

DERIGS, U .

NETWORKS, 1981, 11 (04) :379-390

[3] 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

[4] SHORTEST-PATH FOREST WITH TOPOLOGICAL ORDERING [J].

DIAL, RB .

COMMUNICATIONS OF THE ACM, 1969, 12 (11) :632-&

[5]

Dijkstra E. W., 1959, NUMER MATH, P269, DOI DOI 10.1007/BF01386390

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

DREYFUS, SE .

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

[7] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].

EDMONDS, J ;

KARP, RM .

JOURNAL OF THE ACM, 1972, 19 (02) :248-&

[8]

FREDMAN ML, IEEE F COMPUT SCI, P338

[9]

GALLO G, 1982, SOFTMAT 81P14SOFTMAT

[10]

GILSINN J, 1973, NBS772 US DEP COMM T

← 1 2 3 →