18.433 Combinatorial Optimization

Fall 2003

Figure showing one cycle of the ellipsoid algorithm.
One cycle of the ellipsoid algorithm. (Image by Prof. Santosh Vempala.)

Course Highlights

This course includes a full set of lecture notes, plus problems sets.

Course Description

Combinatorial Optimization provides a thorough treatment of linear programming and combinatorial optimization. Topics include network flow, matching theory, matroid optimization, and approximation algorithms for NP-hard problems.

*Some translations represent previous versions of courses.

Donate Now

Staff

Instructor:
Prof. Santosh Vempala

Course Meeting Times

Lectures:
Two sessions / week
1.5 hours / session

Level

Undergraduate