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. Branchand-bound, cutting plane, and decomposition methods for obtaining solutions or approximating solutions.