Useful links
Unit of study_
COMP4530: Discrete Optimisation
2024 unit information
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.
Unit details and rules
Managing faculty or University school:
Computer Science
| Code | COMP4530 |
|---|---|
| Academic unit | Computer Science |
| Credit points | 6 |
|
Prerequisites:
?
|
(COMP2123 or COMP2823) and (COMP3027 or COMP3927) |
|---|---|
|
Corequisites:
?
|
Enrolment in a thesis unit. INFO4001 or INFO4911 or INFO4991 or INFO4992 or AMME4111 or BMET4111 or CHNG4811 or CIVL4022 or ELEC4712 or COMP4103 or SOFT4103 or DATA4103 or ISYS4103 |
| Prohibitions:
?
|
COMP3530 or COMP5530 |
| Assumed knowledge:
?
|
MATH1064 or MATH1964 or equivalent |
The learning outcomes for this unit will be available two weeks before the first day of teaching.
Unit availability
This section lists the session, attendance modes and locations the unit is available in. There is a unit outline for each of the unit availabilities, which gives you information about the unit including assessment details and a schedule of weekly activities.
The outline is published 2 weeks before the first day of teaching. You can look at previous outlines for a guide to the details of a unit.
| Session | MoA ? | Location | Outline ? |
|---|---|---|---|
|
Semester 2 2024
|
Normal day | Camperdown/Darlington, Sydney |
Outline unavailable
|
There are no availabilities for previous years.
Modes of attendance (MoA)
This refers to the Mode of attendance (MoA) for the unit as it appears when you’re selecting your units in Sydney Student. Find more information about modes of attendance on our website.
