Discrete Optimization.

Catalog description

Semester course; 3 lecture hours. 3 credits. Prerequisite: OPER 527 . Provides the theoretical background necessary to design and evaluate advanced solution techniques for discrete optimization problems. Topics include theory of polyhedra and valid inequalities for integer programming models, matchings, computational complexity, and sufficient conditions for integer programs to be polynomially solvable. Scheduling, packing, covering and routing models will also be examined.