Combinatorial optimization: network flows, bipartite matching, Edmonds algorithm for non-bipartite matching, the matching polytope, matroids, greedy algorithm, matroid union and intersection algorithms, matroid polyhedra, polymatroids. Course Information: Prerequisite(s): MCS 423 and STAT 471.