COMP 567 Discrete Optimization 2 (3 credits)

Offered by: Computer Science (Faculty of Science)


Computer Science (Sci) : Formulation, solution and applications of integer programs. Branch and bound, cutting plane, and column generation algorithms. Combinatorial optimization. Polyhedral methods. A large emphasis will be placed on modelling. Students will select and present a case study of an application of integer programming in an area of their choice.

Terms: This course is not scheduled for the 2017-2018 academic year.

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