Course Websites

Subject offerings of new and developing areas of knowledge in industrial engineering intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. Course Information: Approved for letter and S/U grading. May be repeated in the same or separate terms if topics vary.

Prerequisites: Working knowledge in Linear Programming, Graph Theory, Linear Algebra. This course will cover a series of topics in combinatorial optimization. The emphasis will be on polyhedral theory and structural results. Specific topics to be covered include: Matchings, b-matchings, T-joins, Branchings, Matroids, Matroid Intersections, Polymatroids, Submodular Functions, Directed Cuts, Multi-flows.