18.438 Advanced Combinatorial Optimization


Class Info

Advanced treatment of combinatorial optimization with an emphasis on combinatorial aspects. Non-bipartite matchings, submodular functions, matroid intersection/union, matroid matching, submodular flows, multicommodity flows, packing and connectivity problems, and other recent developments.

This class has 18.433 as a prerequisite.

18.438 will not be offered this semester. It will be instructed by M. X. Goemans.

This class counts for a total of 12 credits. This is a graduate-level class.

In the Spring 2014 Subject Evaluations, 18.438 was rated 6.5 out of 7.0. You can find more information at the 18.438, Spring 2014 site.

MIT 18.438 Advanced Combinatorial Optimization Related Textbooks
MIT 18.438 Advanced Combinatorial Optimization On The Web
18.438, Spring 2014
Tags
graph matroid combinatorial lecture scribe sdp j. vygen cunningham-marsh springer

© Copyright 2015