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.
Course Info
Learning Resource Types
notes
Lecture Notes
assignment
Problem Sets
One cycle of the ellipsoid algorithm. (Image by Prof. Santosh Vempala.)
