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

Quarter Offered

  • As Required