At the end of this course, the students; 1) Formulate industrial engineering problems as network flow problem 2) Define the most widely studied network flow problems such as shortest path, minimum spanning tree and maximum flow 3) Develop mathematical models of network flow problems 4) Use the variety of techniques to solve network optimization problems
MODE OF DELIVERY
Face to face
PRE-REQUISITES OF THE COURSE
No
RECOMMENDED OPTIONAL PROGRAMME COMPONENT
COURSE DEFINITION
COURSE CONTENTS
WEEK
TOPICS
1st Week
Basic Concepts of Graph Theory
2nd Week
Examples of Network Models
3rd Week
Bipartite networks, Mapping, Assignment and Transportation Models
4th Week
Trees, Path and Tour: Spanning Tree Problems
5th Week
Spanning Algorithms
6th Week
Euler Path, Euler Networks
7th Week
Chinese Postman Problem
8th Week
Midterm
9th Week
Hamilton Path and Networks
10th Week
Traveling Salesman Problem and extensions
11th Week
Directional Networks: Shortest Path Problem
12th Week
Maximum Flow Problem
13th Week
Routing Problems
14th Week
Other Network Flow Model Applications
RECOMENDED OR REQUIRED READING
Lecture Notes. P.A. Jensen, J.W. Barnes, Network Flow Programming, John Wiley, 1980. Ahuja, R. K., Magnanti, T. L., Orlin, J. B. (1993), ?Network Flows: Theory, algorithmsand applications?, Prentice Hall:New Jersey. F.Buckley, M.Lewinter, A friendly Introduction to Graph Theory, PEARSON EDUCATION, INC, New Jersey, 2003.