COMP 552 Combinatorial Optimization (4 credits)

Note: This is the 2017–2018 eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or jump to the newest eCalendar.

Offered by: Computer Science (Faculty of Science)

Overview

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.

Terms: Winter 2018

Instructors: Li, Yaqiao (Winter)

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.