Approximate Dynamic Programming by Practical Examples
In: Markov Decision Processes in Practice
Author
Abstract
Suggested Citation
DOI: 10.1007/978-3-319-47766-4_3
Download full text from publisher
To our knowledge, this item is not available for download. To find whether it is available, there are three options:1. Check below whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Rempel, M. & Cai, J., 2021. "A review of approximate dynamic programming applications within military operations research," Operations Research Perspectives, Elsevier, vol. 8(C).
- Boschma, René & Mes, Martijn R.K. & de Vries, Leon R., 2023. "Approximate dynamic programming for container stacking," European Journal of Operational Research, Elsevier, vol. 310(1), pages 328-342.
- Karol Kowalewski, 2018. "Uwarunkowania rozwoju startupów – perspektywa północno-wschodniej Polski," Nowoczesne Systemy Zarządzania. Modern Management Systems, Military University of Technology, Faculty of Security, Logistics and Management, Institute of Organization and Management, issue 3, pages 245-257.
- Heydar, Mojtaba & Mardaneh, Elham & Loxton, Ryan, 2022. "Approximate dynamic programming for an energy-efficient parallel machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 302(1), pages 363-380.
- Ibtihal Ferwana & Suyoung Park & Ting-Yi Wu & Lav R. Varshney, 2023. "Designing Discontinuities," Papers 2305.08559, arXiv.org, revised Dec 2023.
- Blair-Hamilton, Alexis & Raphael, Dennis, 2023. "A critical analysis of the Finnish Baby Box’s journey into the liberal welfare state: Implications for progressive public policymaking," Children and Youth Services Review, Elsevier, vol. 149(C).
More about this item
Keywords
Dynamic programming; Approximate dynamic programming; Stochastic optimization; Monte Carlo simulation; Curse of dimensionality;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:isochp:978-3-319-47766-4_3. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.