It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

IEMS 469: Dynamic Programming VIEW ALL COURSE TIMES AND SESSIONS Prerequisites Basic knowledge of probability (random variables, expectation, conditional probability), optimization (gradient), ...

In a companion paper (Godfrey and Powell 2002) we introduced an adaptive dynamic programming algorithm for stochastic dynamic resource allocation problems, which arise in the context of logistics and ...