Combinatorial Optimization
As taught in: Fall 2003
One cycle of the ellipsoid algorithm. (Image by Prof. Santosh Vempala.)
Instructors:
Prof. Santosh Vempala
MIT Course Number:
18.433
Level:
Undergraduate
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.
