15.083J / 6.859 Integer Programming and Combinatorial Optimization

Fall 2004

A figure illustrating Lagrangean duality.
An example of Lagrangean duality (from Lecture 7). (Image courtesy of Prof. Bertsimas.)

Course Highlights

This course features a full set of lecture notes and assignments.

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.

Technical Requirements

Special software is required to use some of the files in this course: .zip, .m, .mod, .dat.

*Some translations represent previous versions of courses.

Donate Now


Prof. Dimitris Bertsimas

Course Meeting Times

Two sessions / week
1.5 hours / session

One session / week
1 hour / session