6.859J 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 15.081J as a prerequisite.
This class counts for a total of 12 credits. This is a graduate-level class.
You can find more information on MIT OpenCourseWare at the Integer Programming and Combinatorial Optimization site.
© Copyright 2015 Yasyf Mohamedali