Industrial and Systems Engineering 632:
Network Flows and Combinatorial Optimization (3.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. Recommended preparation: Familiarity with the theory of linear programming and with mathematical proofs; knowledge of linear algebra. Duplicates credit in ISE 532.
- Prerequisite: ISE 536
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 31534D | 048 | Lecture | 2:00-4:50pm | Wednesday | 17 of 30 | John Carlsson | KDC240 & ONLINE | PDF (134282 KB) |   |