Advertisement

Scheduling pp 573-579 | Cite as

Deterministic and Stochastic Dynamic Programming

  • Michael L. Pinedo
Chapter

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.New York UniversityNew YorkUSA

Personalised recommendations