35344 Network and Combinatorial Optimisation

6cp; 4hpw

Requisite(s): 35241 Optimisation 1

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

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.