PATH PREFERENCES AND OPTIMAL PATHS IN PROBABILISTIC NETWORKS

被引：65

作者：

EIGER, A ^{[1
]}

MIRCHANDANI, PB ^{[1
]}

SOROUSH, H ^{[1
]}

机构：

[1] RENSSELAER POLYTECH INST, TROY, NY 12181 USA

来源：

关键词：

D O I：

10.1287/trsc.19.1.75

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

SYSTEMS SCIENCE AND CYBERNETICS

引用

页码：75 / 84

页数：10

共 22 条

[1] Bellman R., 1958, Q APPL MATH, V16, P87
[2] ON THE SHORTEST ROUTE THROUGH A NETWORK
DANTZIG, GB
[J]. MANAGEMENT SCIENCE, 1960, 6 (02) : 187 - 190
[3] 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
[4] Dijkstra E.W., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390
[5] ERMOLEV YM, 1966, CYBER, V2, P74
[6] ERMOLEV YM, 1966, CYBERNETICS, V3, P52
[7] ALGORITHM-97 - SHORTEST PATH
FLOYD, RW
[J]. COMMUNICATIONS OF THE ACM, 1962, 5 (06) : 345 - 345
[8] SHORTEST PATHS IN PROBABILISTIC GRAPHS
FRANK, H
[J]. OPERATIONS RESEARCH, 1969, 17 (04) : 583 - &
[9] SHORTEST-PATH ALGORITHMS - COMPARISON
GOLDEN, B
[J]. OPERATIONS RESEARCH, 1976, 24 (06) : 1164 - 1168
[10] Keeney R., 1976, DECISIONS MULTIPLE O