Combinatorial Optimization II

0.5 credit · Graduate

Topics include optimal matching in non-bipartite graphs, Euler tours, and the Chinese Postman problem. Other extensions of network flows: dynamic flows, multicommodity flows, and flows with gains, bottleneck problems. Matroid optimization. Enumerative and heuristic algorithms for the Traveling Salesman and other problems.