Abstract
Dynamic programming is one of the more widely used techniques for dealing with combinatorial optimization problems. Dynamic Programming can be applied to problems that are solvable in polynomial time, as well as problems that cannot be solved in polynomial time (see Appendix C). It has proven to be very useful for stochastic problems as well
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Pinedo, M.L. (2012). Deterministic and Stochastic Dynamic Programming. In: Scheduling. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-2361-4_22
Download citation
DOI: https://doi.org/10.1007/978-1-4614-2361-4_22
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-1986-0
Online ISBN: 978-1-4614-2361-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)