Skip to main content
Unit of study_

Discrete Optimization - COMP3530

Year - 2019

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.

Classes
Lectures, Tutorials

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

Pre-requisites

COMP2007 or COMP2907

Details

Faculty: Engineering and Information Technologies

Semester 2

05 Aug 2019

Department/School: Information Technologies
Study Mode: Normal (lecture/lab/tutorial) day
Census Date: 31 Aug 2019
Unit of study level: Senior
Credit points: 6.0
EFTSL: 0.125
Available for study abroad and exchange: No
Faculty/department permission required? No
Location
Camperdown
Courses that offer this unit

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 undertake cross-institutional study in one or more units of study at the University of Sydney.

To help you understand common terms that we use at the University, we offer an online glossary.