Discrete Optimization (COMP3530)


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.

Our courses that offer this unit of study

Further unit of study information


Lectures, Tutorials


Through semester assessment (50%) and Final Exam (50%)

Faculty/department permission required?


Unit of study rules


COMP2007 or COMP2907

Study this unit outside a degree

Non-award/non-degree study

If you wish to undertake one or more units of study (subjects) for your own interest but not towards a degree, you may enrol in single units as a non-award student.

Cross-institutional study

If you are from another Australian tertiary institution you may be permitted to underake cross-institutional study in one or more units of study at the University of Sydney.