Search Results (1)

View
Selected filters:
  • NP-hard Problems
Combinatorial Optimization, Fall 2003
Conditions of Use:
Remix and Share
Rating

Thorough treatment of linear programming and combinatorial optimization. Topics include network flow, ...

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
Material Type:
Full Course
Textbooks
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Vempala, Santosh S. (Santosh Srinivas)