PERFORMANCE OF SHORTEST-PATH ALGORITHMS IN NETWORK FLOW PROBLEMS

被引：7

作者：

DIVOKY, JJ ^{[1
]}

HUNG, MS ^{[1
]}

机构：

[1] KENT STATE UNIV,GRAD SCH MANAGEMENT,KENT,OH 44242

来源：

关键词：

D O I：

10.1287/mnsc.36.6.661

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：661 / 673

页数：13

共 31 条

[1] AHUJA A, 1988, MIT205988 SLOAN SCH
[2] AHUJA A, 1988, MIT193 OP RES CTR TE
[3] BALL M, 1983, NETWORKS, V13
[4] BUSACKER RG, 1961, ORO15 J HOPK U OP RE
[5] SHORTEST-ROUTE METHODS .1. REACHING, PRUNING, AND BUCKETS
DENARDO, EV
FOX, BL
[J]. OPERATIONS RESEARCH, 1979, 27 (01) : 161 - 186
[6] DERIGS U, 1981, NETWORKS, V11
[7] A NOTE ON THE PARTITIONING SHORTEST-PATH ALGORITHM
DESROCHERS, M
[J]. OPERATIONS RESEARCH LETTERS, 1987, 6 (04) : 183 - 187
[8] COMPUTATIONAL ANALYSIS OF ALTERNATIVE ALGORITHMS AND LABELING TECHNIQUES FOR FINDING SHORTEST PATH TREES
DIAL, R
GLOVER, F
KARNEY, D
KLINGMAN, D
[J]. NETWORKS, 1979, 9 (03) : 215 - 248
[9] SHORTEST-PATH FOREST WITH TOPOLOGICAL ORDERING
DIAL, RB
[J]. COMMUNICATIONS OF THE ACM, 1969, 12 (11) : 632 - &
[10] Dijkstra E. W., 1959, NUMER MATH, P269, DOI DOI 10.1007/BF01386390