ISyE 720: Integer Programming
- Catalog Description:
Formulation of integer programming problems and the characterization of optimization problems representable as integer and mixed-integer programs. The degree of difficulty of classes of integer programs and its relation to the structure of their feasible sets. Optimality conditions. Branch-and-bound, cutting plane, and decomposition methods for obtaining solutions or approximating solutions.
- Credits: 3
- Prerequisites: Comp Sci 525 or cons inst
- Official Course Description (pdf)