Combinatorial Optimization
Free, no sign-up neededFall 2003English
About this course
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.
Description from MIT OpenCourseWare.
Where to take this course
- Open MIT OpenCourseWare (new tab)MIT OpenCourseWare · Fall 2003