15.083 Integer Programming and Combinatorial Optimization
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.
This class has 6.251 as a prerequisite.
Lecture occurs 10:00 AM to 11:30 AM on Mondays and Wednesdays in E51-361.
This class counts for a total of 12 credits.
© Copyright 2015 Yasyf Mohamedali