Network Flows    3 s.h

Catalog description

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, billows. Matching problems in graph theory. Prereq.: ISEN 5801 or MATH 3720 .