Integer Programming and Combinatorial Optimization
As taught in: Fall 2004
An example of Lagrangean duality (from Lecture 7). (Image courtesy of Prof. Bertsimas.)
Instructors:
Prof. Dimitris Bertsimas
MIT Course Number:
15.083J / 6.859
Level:
Graduate
Course Features
Course Description
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.
*Some translations represent previous versions of courses.
