Combinatorial Optimization

1 Course Unit

The course will cover polyhedral theory, structural results and their applications to designing algorithms. Specific topics to be covered include: matchings and their applications, connectivity properties of graphs, matroids and optimization including matroid intersection and union, submodular set functions and applications, arborescences and branchings. Prerequisites: Students must take ESE 5060 or ESE 6050 before taking ESE 6060. 1 Course Unit