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
31534D048Lecture9:30-10:50amTue, Thu11 of 20John CarlssonKAP137PDF (145312 KB)feesession dates
Information accurate as of October 3, 2018 10:51 am.
In Fall 2021, USC is returning to the normal grade option election deadlines and standards. For more information on this, please visit the Fall 2021 academic FAQs.