Max-flow/min-cut theorem; combinatorial applications; minimum cost flow problems (transportation, shortest path, transshipment); solution algorithms (including the out-of-kilter method); implementation and computational considerations.

Prerequisite: MTHSC 440/640, 810 or equivalent