Course Info

CSC 525: Combinatorial Optimization

This course defines and introduces the concepts and techniques needed to formulate and model optimization problems. A set of fundamental problems in combinatorial optimization will be covered together with their applications. The emphasis will be on the design and analysis of algorithms for such problems. The computational complexity of this set of problems (easy/hard to solve/approximate) will be discussed, and techniques for coping with intractable problems will be introduced. PREREQUISITE(S): CSC 421.

Winter 2016-2017

Section: 801
Class number: 27036
Meeting time: Th 5:45PM - 9:00PM
Location: LEWIS 01509 at Loop Campus
Instructor: Iyad Kanj | View syllabus
Section: 810
Class number: 27037
Meeting time: -
Location: N/A at Online Campus
Instructor: Iyad Kanj | View syllabus