Computer Science (Sci): Algorithmic and structural approaches in combinatorial optimization with a focus upon theory and applications. Topics include: polyhedral methods, network optimization, the ellipsoid method, graph algorithms, matroid theory and submodular functions.
Offered by: Computer Science
- 4 hours
- Prerequisite: Math 350 or COMP 362 (or equivalent).
- Restriction: This course is reserved for undergraduate honours students and graduate students. Not open to students who have taken or are taking MATH 552.
- This course is not scheduled for the 2012-2013 academic year.
- There are no professors associated with this course for the 2012-2013 academic year.