AN IMPROVED CONDITIONAL MONTE-CARLO TECHNIQUE FOR THE STOCHASTIC SHORTEST-PATH PROBLEM

被引：11

作者：

ADLAKHA, VG

机构：

来源：

关键词：

D O I：

10.1287/mnsc.32.10.1360

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：1360 / 1367

页数：8

共 10 条

[1]

Battersby A., 1970, NETWORK ANAL PLANNIN

BURT, JM ;

GARMAN, MB .

MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 18 (03) :207-217

[3]

ELMAGHRABY SE, 1977, ACTIVITY NETWORKS PR

FISHMAN, GS .

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

FRANK, H .

[6] A COMPACT HASH FUNCTION FOR PATHS IN PERT NETWORKS [J].

KULKARNI, VG .

[7]

Loulou R., 1976, INFOR. Canadian Journal of Operational Research and Information Processing, V14, P259

[8]

Sigal C. E., 1979, Mathematics and Computers in Simulation, V21, P376, DOI 10.1016/0378-4754(79)90007-7

[9] THE STOCHASTIC SHORTEST ROUTE PROBLEM [J].

SIGAL, CE ;

PRITSKER, AAB ;

SOLBERG, JJ .

[10]

SIGAL CE, 1977, THESIS PURDUE U W LA