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) .

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 ...

Awi Federgruen, Michal Tzur, A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n $\\log$ n) or 0(n) Time, Management Science, Vol. 37, No. 8 (Aug., 1991), pp.