Algorithms for non-linear and stochastic resource constrained shortest path
Year of publication: |
2019
|
---|---|
Authors: | Parmentier, Axel |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 89.2019, 2, p. 281-317
|
Subject: | Resource constrained shortest path | Stochastic shortest path | Risk measures | Lattice ordered monoid | Theorie | Theory | Stochastischer Prozess | Stochastic process | Algorithmus | Algorithm | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming |
-
Truong, Van-Anh, (2014)
-
Running errands in time : approximation algorithms for stochastic orienteering
Gupta, Anupam, (2015)
-
Strinka, Zohar M. A., (2018)
- More ...
-
Future memories are not needed for large classes of POMDPs
Cohen, Victor, (2023)
-
Learning to approximate industrial problems by operations research classic problems
Parmentier, Axel, (2022)
-
Aircraft routing and crew pairing : updated algorithms at Air France
Parmentier, Axel, (2020)
- More ...