15.083 Integer Programming and Combinatorial Optimization


Class Info

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.

15.083 will be offered this semester (Spring 2018). It is instructed by D. J. Bertsimas and A. S. Schulz.

Lecture occurs 10:00 AM to 11:30 AM on Mondays and Wednesdays in E51-085.

This class counts for a total of 12 credits.

You can find more information at the http://www.google.com/search?&q=MIT+%2B+15.083&btnG=Google+Search&inurl=https site or on the 15.083 Stellar site.

MIT 15.083 Integer Programming and Combinatorial Optimization Related Textbooks
MIT 15.083 Integer Programming and Combinatorial Optimization On The Web

© Copyright 2015