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
| Academic unit | Computer Science |
|---|---|
| Credit points | 6 |
| Prerequisites
?
|
COMP9123 or COMP2123 or COMP2823 |
| Corequisites
?
|
None |
|
Prohibitions
?
|
COMP3530 or COMP4530 |
| Assumed knowledge
?
|
COMP3027 and Discrete mathematics and probability (e.g. MATH1064 or equivalent) and Linear algebra (e.g. MATH1061 or equivalent) |
| Available to study abroad and exchange students | Yes |
Teaching staff
| Coordinator | Julian Mestre, julian.mestre@sydney.edu.au |
|---|