This unit introduces students to the algorithmic theory and applications of discrete optimisation. The main aims of this unit are: Learn how to model various practical problems as abstract optimisation problems; Learn the theory underlying efficient algorithms for solving these problems; Learn how to use these tools in practice. Specific topics include: Linear and integer programming, polyhedral theory, and approximation algorithms.
Unit details and rules
|COMP2123 OR COMP2823 OR COMP2007 OR COMP2907
|Available to study abroad and exchange students
|Julian Mestre, firstname.lastname@example.org