Network Optimisation

This subject is not offered in 2016.

170 hours

The following subject, or equivalent:

An introductory-level subject in operations research equivalent to

For the purposes of considering request for Reasonable Adjustments under the Disability Standards for Education (Cwth 2005), and Student Support and Engagement Policy, academic requirements for this subject are articulated in the Subject Overview, Learning Outcomes, Assessment and Generic Skills sections of this entry.

It is University policy to take all reasonable steps to minimise the impact of disability upon academic study, and reasonable adjustments will be made to enhance a student's participation in the University's programs. Students who feel their disability may impact on meeting the requirements of this subject are encouraged to discuss this matter with a Faculty Student Adviser and Student Equity and Disability Support: http://services.unimelb.edu.au/disability

Many practical problems in management, operations research, telecommunication and computer networking can be modelled as optimisation problems on networks. Here the underlying structure is a graph. This subject is an introduction to optimisation problems on networks with a focus on theoretical results and efficient algorithms. It covers classical problems that can be solved in polynomial time, such as shortest paths, maximum matchings, maximum flows, and minimum cost flows. Other topics include complexity and NP-completeness, matroids and greedy algorithms, approximation algorithms, multicommodity flows, and network design. This course is beneficial for all students of discrete mathematics, operations research, and computer science.

After completing this subject, students should:

• be able to understand aspects of network optimisation problems and the methodologies to solve them;
• develop the abilities needed to design combinatorial algorithms for solving other network problems not covered in the subject;
• have the ability to pursue further studies in this and related areas.

Up to 50 pages of written assignments (30%: two assignments worth 15% each, due mid and late in semester), a 3-hour written examination (70%, in the examination period).

Lecture notes prepared by Dr Sanming Zhou, and the textbook by B. Korte and J. Vygen, Combinatorial Optimiation: Theory and Algorithms. 2nd Edition, Springer, Berlin, 2002

TBA

This subject is not available as a breadth subject.

In addition to learning specific skills that will assist students in their future careers in science, they will have the opportunity to develop generic skills that will assist them in any future career path. These include:

• problem-solving skills: the ability to engage with unfamiliar problems and identify relevant solution strategies;
• analytical skills: the ability to construct and express logical arguments and to work in abstract or general terms to increase the clarity and efficiency of analysis;
• collaborative skills: the ability to work in a team;
• time-management skills: the ability to meet regular deadlines while balancing competing commitments.