University of Technology Sydney

37344 Network and Combinatorial Optimisation

6cp; 4hpw
Requisite(s): 35241 Optimisation in Quantitative Management OR 37242 Optimisation in Quantitative Management
These requisites may not apply to students in certain courses. See access conditions.
Anti-requisite(s): 35344 Network and Combinatorial Optimisation


Network and combinatorial optimisation methods are among the main tools used in solving various practical problems, including 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, including the minimum cost network flow problem, the maximum flow problem, the transportation problem, the shortest path problem, and the assignment problem; an introduction to complexity theory; an introduction to modern heuristic techniques for discrete optimisation such as tabu search, genetic algorithms, and simulated annealing. The first component provides optimisation techniques commonly used in practice. The second component teaches how to analyse the complexity of various practical problems. The third component introduces methods for solving very large practical problems.

Typical availability

Spring semester, City campus


This subject was formerly called Network Optimisation.

Detailed subject description.

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.