COMP 566 Discrete Optimization 1 (3 credits)

Offered by: Computer Science (Faculty of Science)


Computer Science (Sci) : Use of computer in solving problems in discrete optimization. Linear programming and extensions. Network simplex method. Applications of linear programming. Vertex enumeration. Geometry of linear programming. Implementation issues and robustness. Students will do a project on an application 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.