35344 Network and Combinatorial Optimisation

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.