6.859J -- Integer Programming and Combinatorial Optimization
Course Description: In-depth treatment of the modern theory of integer programming and combinatorial optimization, emphasizing geometry, duality and algorithms. Topics include formulating problems in integer variables, enhancement of formulations, ideal formulations, integer programming duality, linear and semidefinite relaxations, lattices and their applications, the geometry of integer programming, primal methods, cutting plane methods, connections with algebraic geometry, computational complexity, approximation algorithms, heuristic and enumerative algorithms, mixed integer programming and solutions of large scale problems. Alternate years.

This class is at the Graduate level
This course is also known as: 15.083J
Instructor: D. J. Bertsimas, A. S. Schulz
Open Courseware Website
Prerequisites: 15.081J or permission of instructor

Back to Classes