Combinatorial Optimization I

0.5 credit · Graduate

Network flow theory and related material. Topics will include shortest paths, minimum spanning trees, maximum flows, minimum cost flows. Optimal matching in bipartite graphs.