AMS 546 - Network Flows

Theory of flows in capacity-constrained networks. Topics include maximum flow, feasibility criteria, scheduling problems, matching and covering problems, minimum-length paths, minimum-cost flows, and associated combinatorial problems.

3 credits

Grading Letter graded (A, A-, B+, etc.)