Principal methods used in integer programming and discrete optimization; branch and bound, implicit enumeration, cutting planes, group knapsack, Lagrangian relaxation, surrogate constraints, heuristics (performance analysis), separation/branching strategies and polynomial time algorithms for specific problems on special structures.

Prerequisite: MTHSC 810 or equivalent