Skip to main content
Unit of study_

COMP3530: Discrete Optimization

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
COMP2123 OR COMP2823 OR COMP2007 OR COMP2907

At the completion of this unit, you should be able to:

  • LO1. understand fundamental algorithms for several optimisation problems, such as linear and integer programming, approximation algorithms, and fixed-parameter tractability
  • LO2. implement algorithms and use standard tools for solving real life problems
  • LO3. model application problems as optimisation problems
  • LO4. apply and tailor known algorithms for solving new, and challenging problems.

Unit outlines

Unit outlines will be available 2 weeks before the first day of teaching for the relevant session.