Advanced Combinatorial Optimization

3 Credit Hours

Typical coverage includes: Matching theory, network optimization, traversals in graphs, integrality of polyhedra, matroids, covers, cliques, and stable sets.