𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distributionally robust stochastic shortest path problem

✍ Scribed by Cheng, Jianqiang; Lisser, Abdel; Letournel, Marc

Book ID
122811009
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
178 KB
Volume
41
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Recoverable robust shortest path problem
Recoverable robust shortest path problems
✍ Christina BΓΌsing πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 169 KB

## Abstract In this article, we investigate two different recoverable robust (RR) models to deal with cost uncertainties in a shortest path problem. RR extends the classical concept of robustness to deal with uncertainties by incorporating limited recovery actions after the full data are revealed.

Iterative methods for dynamic stochastic
Iterative methods for dynamic stochastic shortest path problems
✍ Raymond K. Cheung πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 147 KB πŸ‘ 1 views

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

Stochastic Shortest Path Games
Stochastic Shortest Path Games
✍ Patek, Stephen D.; Bertsekas, Dimitri P. πŸ“‚ Article πŸ“… 1999 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 383 KB