Topics in Combinatorial Optimization
A graduate-level MIT OpenCourseWare course covering advanced topics beyond introductory matching, flow, and matroid theory. The course begins with non-bipartite matchings and proceeds through extensions of these fundamental results, emphasizing purely combinatorial derivations such as min-max relations rather than algorithmic methods for finding optimal objects. Materials include lecture notes and readings drawn from research literature in combinatorial optimization. It is aimed at PhD students already versed in optimization, combinatorics, or combinatorial algorithms, so it assumes substantial mathematical background rather than teaching from first principles. As with other MIT OCW offerings, the course is free to access with no certificate offered, and content is published under a Creative Commons license for self-study or supplementary use alongside formal graduate coursework.