COMP 552. Combinatorial Optimization.
Credits: 4
Offered by: Computer Science (Faculty of Science)
This course is not offered this catalogue year.
Description
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.
- 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.