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.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
31534D048Lecture2:00-3:20pmMon, Wed14 of 15John CarlssonGFS216PDF (145396 KB)feesession dates
Information accurate as of October 3, 2017 4:56 pm.
All Summer 2020 courses will be taught remotely. Faculty will contact students to provide information to login to classes.