18.455 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.453 as a prerequisite.

18.455 will not be offered this semester. It will be available in the Spring semester, and will be instructed by M. X. Goemans.

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

You can find more information at the 18.438, Fall 2009 site or on the 18.455 Stellar site.

MIT 18.455 Advanced Combinatorial Optimization Related Textbooks
MIT 18.455 Advanced Combinatorial Optimization On The Web
18.438, Fall 2009
matroid schrijver refs scribe chap lehman l. lovasz aleksander madry shannon

© Copyright 2015