Useful links
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.
Code | COMP3530 |
---|---|
Academic unit | Computer Science |
Credit points | 6 |
Prerequisites:
?
|
COMP2123 OR COMP2823 OR COMP2007 OR COMP2907 |
---|---|
Corequisites:
?
|
None |
Prohibitions:
?
|
None |
At the completion of this unit, you should be able to:
Unit outlines will be available 2 weeks before the first day of teaching for the relevant session.
Key dates through the academic year, including teaching periods, census, payment deadlines and exams.
Enrolment, course planning, fees, graduation, support services, student IT
Code of Conduct for Students, Conditions of Enrollment, University Privacy Statement, Academic Integrity
Academic appeals process, special consideration, rules and guidelines, advice and support
Policy register, policy search
Scholarships, interest free loans, bursaries, money management
Learning Centre, faculty and school programs, Library, online resources
Student Centre, counselling & psychological services, University Health Service, general health and wellbeing