Course Description: Introduction to Graph Theory - Network Models - Mathematical Formulation of Network Problems - Shortest Path Problem (Bellman Algorithm - Dijkstra Algorithm - Bellman-Ford Algorithm) - Maximum Flow Problems (Ford-Fulkerson Method - Max-Flow Min-Cut Theorem) - Minimum Cost Flow Problem - Project Scheduling using CPM and PERT.
Credit hours: 3
Prerequisites: OPER 201
Objectives of the course :
This course aims to supplement the student's knowledge of network models, maximum flow problems, and project scheduling and evaluation methods.
Course outputs :
Gaining knowledge on how to use network models - Acquiring cognitive skills in maximum flow problems - Acquiring practical skills in project scheduling and evaluation.
This website uses special cookies to ensure ease of use, improve your browsing experience, and clarify the terms and policies related to About user privacy. By continuing to browse this website, you acknowledge that you accept the use of cookies and the terms of the Privacy Policy