OPER351

ntroduction to Graph theory. Network models. Mathematical formulation of network problems. Shortest path problem: Bellman algorithm, Dijkstra's algorithm, Bellman-Ford algorithm. Maximum Flow Problem: Ford and Fulkerson algorithm, Max-flow min-cut theorem. Minimum cost flow problem. Project scheduling: CPM and PERT