15.083J / 6.859 Integer Program Combination 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

File decompression software, such as Winzip® or StuffIt®, is required to open the .zip files found on this course site. The .zip files contain additional files which require software as well.

MATLAB® software is required to view and run the .m files on this course site. Any number of programs can be used to run the .mod files found on this course site. Please refer to the course materials for any specific instructions or recommendations. Any number of software tools can be used to import the .dat files found on this course site. Please refer to the course materials for any specific instructions or recommendations.


*Some translations represent previous versions of courses.

Donate Now

Staff

Instructor:
Prof. Dimitris Bertsimas

Course Meeting Times

Lectures:
Two sessions / week
1.5 hours / session

Recitations:
One session / week
1 hour / session

Level

Graduate

*Translations