Networks and Combinatorial Optimization

3 credits

Mathematical foundations of combinatorial and network optimization with an emphasis on structure and algorithms with proofs. Topics include combinatorial and geometric methods for optimization of network flows, matching, traveling salesmen problem, cuts, and stable sets on graphs. Special emphasis on connections to linear and integer programming, duality theory, total unimodularity, and matroids. Prerequisite: either MATH 208 or AMATH 352; and any additional 400-level MATH course. Offered: jointly with AMATH 514.