Integer Programming and Combinatorial Optimization

A figure illustrating Lagrangean duality.

An example of Lagrangean duality, discussed in Lecture 8. (Image by Prof. Bertsimas.)


MIT Course Number

15.083J / 6.859J

As Taught In

Fall 2009



Cite This Course

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.

Bertsimas, Dimitris, and Andreas Schulz. 15.083J Integer Programming and Combinatorial Optimization, Fall 2009. (MIT OpenCourseWare: Massachusetts Institute of Technology), (Accessed). License: Creative Commons BY-NC-SA

For more information about using these materials and the Creative Commons license, see our Terms of Use.