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
?
|
(COMP2123 or COMP2823) and (COMP3027 or COMP3927) and 120 credit points |
Corequisites
?
|
None |
Prohibitions
?
|
COMP3530 or COMP5530 |
Assumed knowledge
?
|
MATH1064 or MATH1964 or equivalent |
Available to study abroad and exchange students | Yes |
Teaching staff
Coordinator | Tony Wirth, anthony.wirth@sydney.edu.au |
---|---|
Lecturer(s) | Tony Wirth, anthony.wirth@sydney.edu.au |
Tutor(s) | Alex Tan, alexander.d.tan@sydney.edu.au |