The stochastic shortest path problem : a polyhedral combinatorics perspective
Year of publication: |
2020
|
---|---|
Authors: | Guillot, Matthieu ; Stauffer, Gautier |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 285.2020, 1 (16.8.), p. 148-158
|
Subject: | Markov processes | Stochastic shortest path | Value iteration | Policy iteration | Dijkstra | Theorie | Theory | Stochastischer Prozess | Stochastic process | Markov-Kette | Markov chain |
-
Yu, Huizhen, (2015)
-
Robust adaptive routing under uncertainty
Flajolet, Arthur, (2018)
-
Dynamic project expediting : a stochastic shortest-path approach
Bertazzi, Luca, (2024)
- More ...
-
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
Liebling, Thomas M., (2004)
-
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
Liebling, Thomas M., (2004)
-
Robust modeling and planning: Insights from three industrial applications
Marla, Lavanya, (2020)
- More ...