OPER 351

Models of network problems and introduction to graph theory
The shortest path problem : Theory and methods
The maximum flow problem : Ford & Fulkerson algorithm
The maximum flow- minimum cut Theorem
The minimum cost flow problem
Project scheduling : PERT and CPM