Prof. Dimitris Bertsimas
Prof. Andreas Schulz
15.083J / 6.859J
The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.
Bertsimas, Dimitris, and Andreas Schulz. 15.083J Integer Programming and Combinatorial Optimization, Fall 2009. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/sloan-school-of-management/15-083j-integer-programming-and-combinatorial-optimization-fall-2009 (Accessed). License: Creative Commons BY-NC-SA