IE 519
Spring 2022 Part of Term 1
Part of Term 1
Jan 18-May 4
Jan 18-May 4
Credit: 4 hours.
The course will cover a series of topics in combinatorial optimization. The emphasis will be on polyhedral theory, structural results and their applications to designing algorithms. Specific topics to be covered include: Matchings, b-matchings, T-joins, T-cuts, Arborescences, Branchings, Matroids, Matroid Intersection, Polymatroids, Submodular Functions, Directed Cuts, Multi-flows.
Same as CS 586. 4 graduate hours. No professional credit. Prerequisite: Familiarity with linear programs (IE 411 or equivalent), Algorithms (CS 374 or equivalent), and Graph Theory (Math 412 or equivalent).
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
70395
|
Lecture
|
A
|
11:00AM
-12:20PM
|
TR
|
0216 Siebel Center for Comp Sci
|
Chekuri, C
|
|