Industrial and Systems Engineering 632:
Network Flows and Combinatorial Optimization (4.0 units)
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
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 31534D | 048 | Lecture | 4:00-5:50pm | Mon, Wed | 8 of 30 | John Carlsson | ZHS360 | PDF (227889 KB) |  |