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

A discrete time model is presented for dynamic traffice assignment with a single destination. Congestion is treated explicitly in the flow equations. The model is a nonlinear and nonconvex ...