(Complete Item Description)
- Abstract:
-
Thorough treatment of linear programming and combinatorial optimization. Topics include network flow, matching theory, matroid optimization, and approximation algorithms for NP-hard problems. 18.310 helpful but not required.
- Subject:
- Mathematics and Statistics
- Grade Level:
- Post-secondary
- Collection:
- MIT OpenCourseWare
Rate this resource by using the left and right arrow keys and pressing Enter.
Remix and Share