35447 Discrete Optimisation
6cp; 4hpwThe 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
2009 contribution for post-2008 Commonwealth-supported students: $520.25
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.
2009 amount for undergraduate domestic fee-paying students: $2,587.50
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.125Access 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.
