Carnegie Mellon University

Advanced Integer Programming

Course Number: 47831

This graduate-level course is a sequel to 47-830 Integer Programming. The following advanced topics will be covered: The size of a smallest perfect formulation. Infinite relaxations. Equivalence between Optimization and Separation. Integer programming in fixed dimension. Basis reduction. Lenstra's algorithm. Semidefinite bounds. Max cut. The Lovasz-Schrijver relaxation. The Sherali-Adams and the Lasserre hierarchies. Other current research topics.

Degree: PhD
Concentration: Operations Research
Academic Year: 2022-2023
Semester(s): Mini 4
Required/Elective: Elective
Units: 6


Lecture: 100min/wk and Recitation: 50min/wk