ISE 632 Network Flows and Combinatorial Optimization

Units: 3
Terms Offered: Sp

Combinatorial optimization, particularly graph problems. Shortest paths, max flow, minimum cost flows, spanning trees, matroids, submodular functions. Bipartite and general matchings, polyhedral combinatorics, total unimodularity.
Prerequisite: ISE 536;
Recommended Preparation: familiarity with the theory of linear programming and with mathematical proofs; knowledge of linear algebra.
Duplicates Credit in ISE 532.
Instruction Mode: Lecture
Grading Option: Letter