One cycle of the ellipsoid algorithm. (Image by Prof. Santosh Vempala.)
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.
| Instructor: | |
| Course Number: |
|
| Departments: | |
| Topics: | |
| As Taught In: | Fall 2003 |
| Level: |
Undergraduate
|
Learning Resource Types
notes
Lecture Notes
assignment
Problem Sets