COMP 567
3 credits
Discrete Optimization 2

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.

Offered by: Computer Science