Feedback

COMP 552 Combinatorial Optimization (4 credits)

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: Fall 2013

Instructors: Frederick Shepherd (Fall)

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