Discrete Optimization (COMP3530)
UNIT OF STUDY
This unit introduces students to the algorithmic theory and applications of discrete optimization. The main aims of this unit are: (i) learn how to model various practical problems as abstract optimization problems, (ii) learn the theory underlying efficient algorithms for solving these problems, (iii) learn how to use these tools in practice.
Specific topics include: Linear and integer programming, polyhedral theory, min-cost max-flow problems, approximation algorithms, and fixed parameter tractability.
Further unit of study information
Lecture 2 hrs/week; Tutorial 1 hr/week.
Through semester assessment (50%) Final Exam (50%)
Faculty/department permission required?
Unit of study rules
Prerequisites and assumed knowledge
COMP2007 or COMP2907, COMP2007 or COMP2907, COMP2007 or COMP2907
Study this unit outside a degree
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.
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.