Integer Programming

Techniques for formulating and solving discrete valued and combinatorial optimization problems. Topics include enumerative and cutting plane methods, Lagrangian relaxation, Benders' decomposition, knapsack problems, and matching and covering problems.