35447 Discrete Optimisation

6cp; 4hpw

The aim of this subject is two-fold: to introduce ideas of the theory of computational complexity and to present a variety of optimisation methods and algorithms which are commonly used in discrete optimisation. It presents a variety of discrete optimisation models, introduces the main concepts of the theory of computational complexity, and describes the most commonly used methods of discrete optimsation including modern heuristic techniques.

Assessment: Eight assignments worth 10 per cent each; one end-of-semester test worth 20 per cent.

Typical availability

Autumn semester, City campus
This subject is offered subject to demand.

Fee information

2007 contribution for post-2004 Commonwealth-supported students: $889.75
2007 amount for undergraduate domestic fee-paying students: $2,220.00
Subject EFTSL: 0.125
Note: The above fees are applicable in 2007 for Commonwealth-supported students who commenced after 2004 and domestic fee-paying undergraduate students only. Pre-2005 Commonwealth-supported students should consult the Student contribution charges for Commonwealth supported students webpage.
Not all students are eligible for Commonwealth supported places, and not all subjects are available to Commonwealth supported students. Domestic fee-paying students and international students should refer to the Fees webpage.

Access conditions

Note: The requisite information presented in this subject description covers only academic requisites. Full details of all enforced rules, covering both academic and admission requisites, are available at Access conditions and My Student Admin.