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

The author introduces some basic dynamic programming techniques, using examples, with the help of the computer algebra system Maple. The emphasis is on building confidence and intuition for the ...

Materials Warren B. Powell; Approximate Dynamic Programming: Solving the Courses of Dimensionality; John Wiley & Sons, 2007. [topics 5 and 6 not in the textbook] prerequisites Basic knowledge of ...

F. Polimeno, T. Rehman, H. Neal, C. M. Yates, Integrating the use of Linear and Dynamic Programming Methods for Diary Cow Diet Formulation, The Journal of the ...