One cycle of the ellipsoid algorithm. (Image by Prof. Santosh Vempala.)
Instructor(s)
Prof. Santosh Vempala
MIT Course Number
18.433
As Taught In
Fall 2003
Level
Undergraduate
Course Description
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.