Skip to content. Skip to navigation
McGill Home SOCS Home
Personal tools
You are here: Home Academic Courses Course Profile

COMP- 567: DISCRETE OPTIMIZATION 2

Course Summary

Formulation, solution and applications of integer programs. Branch and bound, cutting plane, and column generation algorithms. Combinatorial optimization. Polyhedral methods. Stochastic Optimization. A large emphasis will be placed on modeling. Students will select and present a case study of an application of integer programming in an area of their choice. Prerequisites: COMP566 or MATH 417/487 or COMP/MATH 551 or a course in linear algebra and a good knowledge of linear programming


McGill Course Description (Click Here)


Fall 2013

Instructor:

  • David Avis
        Phone: 398-3737
        E-mail: avis@cs.mcgill.ca
        Office Hours: By appointment