COMP 552 Combinatorial Optimization (4 credits)

Note: This is the 2016–2017 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to 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: This course is not scheduled for the 2016-2017 academic year.

Instructors: There are no professors associated with this course for the 2016-2017 academic year.

  • 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.