No products in the cart.
(
ratings
)
students
Created by:
Last updated:
December 6, 2022
Duration:
Unlimited Duration
FREE
This course includes:
Unlimited Duration
Badge on Completion
Certificate of completion
Unlimited Duration
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 Curriculum
- 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
About the instructor
0
Instructor Rating
0
Reviews
1520
Courses
1794
Students
Massachusetts Institute of Technology
