The course aims to give a foundation of advanced techniques that lead to efficient exact algorithms. After an introduction to fundamental polyhedral concepts such as integral polyhedra and their connection to totally unimodular matrices, the course focuses on matroids and their connection to greedy algorithms.
The last part of the course introduces expander graphs from a combinatorial optimization point of view.