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.
Autumn semester, City campus
This subject is offered subject to demand.
2008 contribution for post-2008 Commonwealth-supported students: $907.50
Note: Students who commenced prior to 1 January 2008 should consult the Student contribution charges for Commonwealth supported students
Not all students are eligible for Commonwealth Supported places.
2008 amount for undergraduate domestic fee-paying students: $2,490.00
Note: Fees for Postgraduate domestic fee-paying students and international students are charged according to the course they are enrolled in. Students should refer to the Annual Fees Schedule.
Subject EFTSL: 0.125