University of Technology SydneyHandbook 2006

35344 Network and Combinatorial Optimisation1

6cp; 4hpw
Requisite(s): 35241 Optimisation 1

This subject is comprised of three components: dynamic programming, network models and solution methods; and an introduction to modern heuristic techniques for discrete optimisation. The dynamic programming component includes both deterministic and stochastic dynamic programming. The network component includes transportation and trans-shipment problems, the critical path method, the maximum flow problem, the minimum cost network flow problem, and the spanning tree problem. The subject also introduces the concepts of local search and its modifications such as tabu search and simulated annealing.

Typical availability

Spring semester, City campus

Footnote(s)

1. This subject was formerly called 35344 Network Optimisation.

Fee information

2006 contribution for 2005/06 commencing Commonwealth-supported undergraduate students: $872.38
2006 amount for undergraduate domestic fee-paying students: $2,190.00
Subject EFTSL: 0.125
Note: The above fees are applicable in 2006 for 2005/06 commencing Commonwealth-supported and domestic fee-paying undergraduate students only. Pre-2005 Commonwealth-supported undergraduate 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. Other students (such as postgraduate 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.