³ÉÈËVRÊÓƵ

COMP 567 Discrete Optimization 2 (3 credits)

Note: This is the 2010–2011 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) : 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 2010-2011 academic year.

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

  • 3 hours
  • Prerequisites: COMP 566 or MATH 417
Back to top