MATH 5809 [0.5 credit] (MAT 5306)
Combinatorial Optimization II
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 "hard" problems.Prerequisite: MATH 5808.
Summer session: some of the courses listed in this Calendar are offered during the summer. Hours and scheduling for summer session courses will differ significantly from those reported in the fall/winter Calendar. To determine the scheduling and hours for summer session classes, consult the class schedule at central.carleton.ca
Not all courses listed are offered in a given year. For an up-to-date statement of course offerings for the current session and to determine the term of offering, consult the class schedule at central.carleton.ca
