6.859J 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.

6.859J will not be offered this semester. It will be available in the Spring semester, and will be instructed by D. J. Bertsimas and A. S. Schulz.

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.

MIT 6.859J Integer Programming and Combinatorial Optimization Related Textbooks
MIT 6.859J Integer Programming and Combinatorial Optimization On The Web
Integer Programming and Combinatorial Optimization
Tags
license creative by-nc-sa combinatorial massachusetts institute of technology creative commons

© Copyright 2015