CO 452 Integer Programming
Combinatorics and Optimization (2009-2010)

Formulation of problems as integer linear programs. Solution by branch-and-bound and cutting plane algorithms. Introduction to the theory of valid inequalities and polyhedral combinatorics.

Prerequisites: CO 351 or 355; Cumulative overall average of at least 80%; Not open to General Mathematics students