OPTIMAL PATHS IN PROBABILISTIC NETWORKS - A CASE WITH TEMPORARY PREFERENCES

被引：55

作者：

MIRCHANDANI, PB ^{[1
]}

SOROUSH, H ^{[1
]}

机构：

[1] MICHIGAN TECHNOL UNIV,MANAGEMENT SCI,HOUGHTON,MI 49931

来源：

关键词：

D O I：

10.1016/0305-0548(85)90034-6

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

引用

页码：365 / 381

页数：17

共 10 条

[1]

Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[2] PATH PREFERENCES AND OPTIMAL PATHS IN PROBABILISTIC NETWORKS [J].

EIGER, A ;

MIRCHANDANI, PB ;

SOROUSH, H .

[3] ALGORITHM-97 - SHORTEST PATH [J].

FLOYD, RW .

[4] SHORTEST PATHS IN PROBABILISTIC GRAPHS [J].

FRANK, H .

[5]

KEENY RL, 1976, DECISIONS MULTIPLE O

LOUI, RP .

[7]

Mirchandani P. B., 1979, Transportation Science, V13, P85, DOI 10.1287/trsc.13.2.85

[8] SHORTEST DISTANCE AND RELIABILITY OF PROBABILISTIC NETWORKS [J].

MIRCHANDANI, PB .

[9]

MIRCHANDANI PB, 1982, TRS8202 RENSS POL I

[10]

MIRCHANDANI PB, 1981, TRS8101 RENSS POL I