Combinatorial Optimization provides a thorough treatment of linear programming and combinatorial optimization.
FREE
This course includes
Hours of videos
361 years
Units & Quizzes
13
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
Topics include network flow, matching theory, matroid optimization, and approximation algorithms for NP-hard problems.
Course Currilcum
- Matching Algorithms Unlimited
- Polyhedral Combinatorics Unlimited
- The Matching Polytope: Bipartite Graphs Unlimited
- The Matching Polytope: General Graphs Unlimited
- Flow Duality and Algorithms Unlimited
- Minimum Cuts Unlimited
- Linear Programs Unlimited
- The Simplex Algorithm Unlimited
- The Primal-dual Algorithm Unlimited
- The Ellipsoid Algorithm Unlimited
- Separation Oracles Unlimited
- NP-completeness Unlimited
- Approximation Algorithms Unlimited
