35344 Network and Combinatorial Optimisation
6cp; 4hpwRequisite(s): 35241 Optimisation in Quantitative Management
Network and combinatorial optimisation methods are among the main tools used in solving problems that arise in supply chain management, personnel planning and scheduling, production scheduling and choosing the best route for vehicles. This subject has three components: network models and solution methods, complexity theory, and an introduction to modern heuristic techniques for discrete optimisation. The network component includes the minimum cost network flow problem, the maximum flow problem, and the shortest path problem. The subject introduces the concepts of local search and other heuristic techniques such as taboo search, genetic algorithms and simulated annealing.
Typical availability
Spring semester, City campus
Note(s)
This subject was formerly called Network Optimisation.
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.
