Integer Programming

Catalog description

Credits 3. 3 Lecture Hours. Formulation principles and general approaches for solving integer (and mixed, integer linear) programs including preprocessing, cutting plane methods, branch and bound, branch and cut, branch and price, and Lagrange relaxation; classical problem structures with special-purpose solution algorithms; fundamental theory of polyhedra, methods to generate valid inequalities and computational complexity. Prerequisite: ISEN 620 or ISEN 622 .