Prof. Santosh Vempala
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.
Vempala, Santosh. 18.433 Combinatorial Optimization, Fall 2003. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/mathematics/18-433-combinatorial-optimization-fall-2003 (Accessed). License: Creative Commons BY-NC-SA