King Saud University
  Help (new window)
Search


Guidelines_English_Final
تحميل الدليل التدريبي

أسئلة شائعة


 

EXAMS SAMPLE نماذج امتحانات

0R351_1_1430-1429.docx

0R351_Final_exam_1430_1431-2.docx

0RMidexam_1429_1430-2.docx

OR 351 FINAL EXAM 426.doc

OR 351 FINAL EXAM_1429-30.docx

OR 351 FINAL EXAM_1429-30_1.docx 

 

 

OR351_courseinformations.docx

 

 

 

 

King Saud University - College of Sciences

Department of  Statistics and Operations Research

 

 

 

Course Specification

 

 

 

OR 351  :   Network Analysis

    

 

   A.  Objectives 

 

·        Formulation of real world problems as optimization problems  in networks

·        Study various optimization techniques to solve the network models

 

 

 

B.  Course Description 

 

Topic

No of

Weeks

Contacthours

 

 Models of network problems and introduction to graph theory

 

 

2

 

6

 

The shortest path problem :  Theory and  methods

 

 

4

 

12

 

The maximum flow problem :  Ford & Fulkerson algorithm

 

 

3

 

9

 

The maximum flow- minimum cut Theorem

 

 

1

 

3

 

The minimum cost flow problem

 

 

1

 

3

 

Project scheduling  :  PERT and CPM

 

 

4

 

12

 

C. Course Evaluation

 

Assessment

Assessment task

Week due

Proportion of Final Assessment

1

 

Homework assignments

3, 5, 8, 10

10%

2

 

Midterm exam 1

6, 7

20%

3

 

Midterm exam 2

11, 12

20%

4

 

Final exam

16

50%

 

 

D.  Learning Resources

 

1. Required Text(s)

Linear programming and network flows by Bazaraa, M. and Jarvis, J.

 

2. Essential References

Operations research : An introduction  By  Hamdy A. Taha

 

3. Electronic Materials, Web Sites etc

Websites on the internet that are relevant to the topics of the course

 

4. Other learning material such as computer-based programs/CD, professional standards/regulations

 

Computer software available at the departmental computer laboratories

 

 

 
King   Saud University. All rights reserved, 2007 | Disclaimer | CiteSeerx