Network Flows

3 credits · College of Engineering catalogue

Advisory Prerequisite: IOE 510 (MATH 561) (TO 518) . Enforced Prerequisite: None. (3 credits) Flow problems on networks. Maximum flow minimum cut theorem. Labeling algorithms. Circulation and feasibility theorems. Sensitivity analysis. Incidence matrices. Shortest routes. Minimum cost flows, out-of-kilter algorithm. Critical path networks, project cost curves. Multi-commodity flow problem, biflows. Matching problems in graph theory.