Advanced Integer Programming

Catalog description

In-depth review of solution methods: Lagrangean relaxation and column generation, Benders partitioning, cross-decomposition, surrogate relaxation, cutting planes and valid inequalities, logical processing, probing, branch-and-bound, branch-and-price. Study of special problems and applications: matching, location, generalized assignment, traveling salesman, forest planning, production scheduling. Prerequisite: OIDD 910/ESE 504 or equivalent. Please email the instructor for any questions regarding the prerequisite.