MATH 8140 - Network Flow Programming

3 Credits (3 Contact Hours)

Max-flow/min-cut theorem, combinatorial applications, minimum cost flow problems (transportation, shortest path, transshipment), solution algorithms (including the out-of-kilter), and implementation and computational considerations. Students are expected to have completed a graduate-level course in linear programming before enrolling in this course. Offered fall semester only.