Useful links
Unit of study_
COMP3530: Discrete Optimization
2023 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 | COMP3530 |
|---|---|
| Academic unit | Computer Science |
| Credit points | 6 |
|
Prerequisites:
?
|
COMP2123 OR COMP2823 OR COMP2007 OR COMP2907 |
|---|---|
|
Corequisites:
?
|
None |
| Prohibitions:
?
|
None |
| Assumed knowledge:
?
|
None |
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 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.
There are no availabilities for this year.
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.
