Sensitivity-based nested partitions for solving finite-horizon Markov decision processes
Year of publication: |
September 2017
|
---|---|
Authors: | Chen, Weiwei |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 45.2017, 5, p. 481-487
|
Subject: | Approximate dynamic programming | Markov decision processes | Nested partitions | Sensitivity-based approach | Theorie | Theory | Entscheidung | Decision | Mathematische Optimierung | Mathematical programming | Markov-Kette | Markov chain |
-
An approximate dynamic programming approach for sequential pig marketing decisions at herd level
Pourmoayed, Reza, (2019)
-
Efficient algorithms of pathwise dynamic programming for decision optimization in mining operations
Hinz, Juri, (2020)
-
Optimal dynamic resource allocation to prevent defaults
Ayesta, U., (2016)
- More ...
-
A worstâcase formulation for constrained ranking and selection with input uncertainty
Shi, Zhongshun, (2019)
-
Xiao, Hui, (2021)
-
Chen, Weiwei, (2021)
- More ...