Integer and Dynamic Programming

4 credits

Modeling and optimization of problems and dynamic programming approach to optimization. Topics include: integer programming formulation techniques, linear and Lagrangian relaxation, branch-and-bound and cutting-plane methods, integer programming applications, and dynamic programming. Prerequisite: IND E 311. Offered: Sp.