COMP 567. Discrete Optimization 2.
Credits: 3
Offered by: Computer Science (Faculty of Science)
This course is not offered this catalogue year.
Description
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.
- Prerequisites: COMP 566 or MATH 417
- 3 hours
- Prerequisites: COMP 566 or MATH 417