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.
Details
Academic unit | Computer Science |
---|---|
Unit code | COMP3530 |
Unit name | Discrete Optimization |
Session, year
?
|
Semester 2, 2021 |
Attendance mode | Normal day |
Location | Remote |
Credit points | 6 |
Enrolment rules
Prohibitions
?
|
None |
---|---|
Prerequisites
?
|
COMP2123 OR COMP2823 OR COMP2007 OR COMP2907 |
Corequisites
?
|
None |
Available to study abroad and exchange students | No |
Teaching staff and contact details
Coordinator | Julian Mestre, julian.mestre@sydney.edu.au |
---|