Minimizing risk models in stochastic shortest path problems
โ Scribed by Yoshio Ohtsubo
- Book ID
- 105857868
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 201 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0340-9422
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We consider a routing policy that forms a dynamic shortest path in a network with independent, positive and discrete random arc costs. When visiting a node in the network, the costs for the arcs going out of this node are realized, and then the policy will determine which node to visit next with the
This paper describes methods for computing measures related to shortest paths in networks with discrete random arc lengths. These measures include the probability that there exists a path with length not exceeding a specified value and the probability that a given path is shortest. The proposed meth