Mixed-Integer Programming

Course content

Content:

• basic polyhedral theory
• total unimodularity, total dual integrality
• Chvatal closure, (Chvatal-)Gomory cuts, cutting plane methods
• relaxations (Lagrange, LP) and decomposition techniques
• branch-and-bound algorithms and their components
• branch-and-cut, separation problems and cutting plane generation
• branch-and-price, decomposition and column generation
• mixed-integer nonlinear programming