OA4202 Network Flows and Graphs

Introduction to formulation and solution of problems involving networks, such as maximum flow, shortest route, minimum cost flows, and PERT/CPM. Elements of graph theory, data structure, algorithms, and computational complexity. Applications to production and inventory, routing, scheduling, network interdiction, and personnel management.

Prerequisite

OA3201

Lecture Hours

4

Lab Hours

0

Course Learning Outcomes

Upon successful completion of OA4202, you will be able to:

·      Read and understand existing network models.

·      Formulate network models to reflect real-world decision problems.

·      Understand the step-by-step processes (algorithms) available to solve these models.

·      Implement these models and algorithms in software and understand their solutions.