University of Melbourne
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.
📌 课程信息来源于 Melbourne University Handbook,选课建议为 AI 生成仅供参考。请以官方 Handbook 为准。
数据更新时间:2026 年 2 月 | WhiteMirror 不对信息准确性承担责任