logoClassRank

Curtin University

Areas of Study

Network Optimisation 202

  • 302292
  • Semester 2
  • 25.0
Average Rating
Difficulty Level

Basic definitions and applications of graph theory to network design and analysis, scheduling, facility layout design and various allocation problems. Basic concepts of network flows: max-flow min-cut theorem, feasible flows and algorithms. Algorithm for maximum matchings in bipartite graphs. Project and planning: critical path method (CPM) and program evaluation and review technique (PERT), resource allocation problems and time constraints. -- Course Website



Post an anonymous review of this course

Overall experience
Difficulty Level
POST