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 3) Create mathematical models of network flow problems 4) Explain 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
None
COURSE DEFINITION
Flow problems on the network, transportation and assignment problems. Special-purpose algorithms and advanced computing techniques. Maximum flow problem, the theory, algorithms and its applications. Shortest path algorithm, network simplex method. Traveling salesman problem and its extensions.
COURSE CONTENTS
WEEK
TOPICS
1st Week
Scientific Development and Graph Theory
2nd Week
Basic Concept and Initial Generalities
3rd Week
Edge, Path, Circuit, and special networks
4th Week
Euler path, Euler network
5th Week
Operations on networks
6th Week
Directional Networks
7th Week
Hamiltonian path and Hamiltonian tour
8th Week
Midterm
9th Week
Trees
10th Week
Bipartite networks
11th Week
Matching Problems
12th Week
Relationship Matrices in Networks
13th Week
Network Flow Models
14th Week
Applications
RECOMENDED OR REQUIRED READING
Ders Notları. F.Buckley, M.Lewinter, A friendly Introduction to Graph Theory, PEARSON EDUCATION, INC, New Jersey, 2003. Tero Harju, Lecture Notes on Graph Theory, University of Turku, Finland, 2012.