You are here: Home / Future students / Course search

Discrete Optimization

COMP3530

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, fixed parameter tractability, local search and meta-heuristics.

Unit of study details

Unit of study level: Senior

Credit points: 6

Commencing semesters: 2

Further unit of study information

Unit of study handbook: COMP3530

Costs and scholarships information: Costs and Scholarships

Final dates to withdraw from units of study: Census Dates

Available for study abroad and exchange: No

Our courses that offer this unit of study