Optimal Paths in Probabilistic Networks

被引：5

作者：

D. D. M. L. Rasteiro

A. J. B. Anjo

机构：

来源：

关键词：

Optimal Path; Probabilistic Network;

D O I：

10.1023/B:JOTH.0000013560.69722.c1

中图分类号：

学科分类号：

摘要：

引用

页码：974 / 987

页数：13

共 29 条

[11]

Henig M. I.(1999)The optimal path problem Investigação Operacional 19 43-60

[12]

Jaillet P.(1985)Optimal paths in probabilistic networks: a case with temporary preferences Comput. Oper. Res. 12 365-383

[13]

Kamburowski J.(1996)A relaxation-based pruning technique for a class of stochastic shortest path problems Transp. Sci. 30 220-236

[14]

Loui R. P.(1997)Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function Eur. J. Oper. Res. 103 209-229

[15]

Martins E. Q. V.(1998)Stochastic shortest path problems with piecewise linear concave utility functions Manage. Sci. 44 125-136

[16]

Pascoal M. M. B.(1980)The stochastic shortest route problem Oper. Res. 28 1122-1129

[17]

Rasteiro D. M. L. D.(undefined)undefined undefined undefined undefined-undefined

[18]

Santos J. L. E.(undefined)undefined undefined undefined undefined-undefined

[19]

Mirchandani P. B.(undefined)undefined undefined undefined undefined-undefined

[20]

Soroush H.(undefined)undefined undefined undefined undefined-undefined