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. This course is offered as both MBA 546 and AMS 546.
3 credits, ABCF grading
Text:Network Flows, by Ahuja, Magnanti, and Orlin, 93, PRecntice-Hall
ISBN#: 9780136175490 - Recommended