Translations*

18.433 Combinatorial Optimization

As taught in: Fall 2003

Two adjoinging ellipses.

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

Level:

Undergraduate

Instructors:

Prof. Santosh Vempala

Course Features

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.