TÜRKÇE
ENGLISH
Information
| Unit | INSTITUTE OF NATURAL AND APPLIED SCIENCES |
| INDUSTRIAL ENGINEERING (PhD) | |
| Code | EM545 |
| Name | Network Models in Operations Research |
| Term | 2019-2020 Academic Year |
| Term | Fall |
| Duration (T+A) | 3-0 (T-A) (17 Week) |
| ECTS | 6 ECTS |
| National Credit | 3 National Credit |
| Teaching Language | İngilizce |
| Level | Belirsiz |
| Type | Normal |
| Mode of study | Yüz Yüze Öğretim |
| Catalog Information Coordinator | Prof. Dr. RIZVAN EROL |
| Course Instructor |
The current term course schedule has not been prepared yet.
|
Course Goal / Objective
This course aims to study basic network optimization problems and algorithms along with applications in transportation, logistics, manufacturing, computer science, project management, and finance.
Course Content
Network flow problems, Transportation and assignment problems, Shortest path problem, Maximum flow problem, Minimum cost flows, Network simplex method, Multicommodity flow problems, Generalized networks, Special purpose algorithms, Advanced computational techniques.
Course Precondition
Resources
Notes
Course Learning Outcomes
| Order | Course Learning Outcomes |
|---|---|
| LO01 | Develops a network representation of an operations research problem. |
| LO02 | Selects and/or develops a suitable network solution algorithm for a problem. |
| LO03 | Evaluates the computational complexity of the network flow problems. |
Relation with Program Learning Outcome
| Order | Type | Program Learning Outcomes | Level |
|---|---|---|---|
| PLO01 | - | Understands, interprets and applies knowledge in his/her field domain both in-depth and in-breadth by doing scientific research in industrial engineering. | 4 |
| PLO02 | - | Acquires comprehensive knowledge about methods and tools of industrial engineering and their limitations. | 4 |
| PLO03 | - | Designs and performs analytical modeling and experimental research and analyze/solves complex matters emerged in this process. | 5 |
| PLO04 | - | Completes and applies the knowledge by using scarce and limited resources in a scientific way and integrates the knowledge into various disciplines. | 4 |
| PLO05 | - | Keeps up with the recent changes and applications in the field of Industrial Engineering and examines and learns these innovations when necessary. | 4 |
| PLO06 | - | Has the ability to propose new and/or original ideas and methods, develops innovative solutions for designing systems, components or processes. | 5 |
| PLO07 | - | Develops original definitions that will provide innovation to the field at the level of expertise for current and advanced information in the field based on graduate qualifications. | 4 |
| PLO08 | - | Designs Industrial Engineering problems, develops innovative methods to solve the problems and applies them. | 5 |
| PLO09 | - | Works in multi-disciplinary teams and takes a leading role and responsibility. | 4 |
| PLO10 | - | Identifies, gathers and uses necessary information and data. | 4 |
| PLO11 | - | Follows, studies and learns new and developing applications of industrial engineering. | 4 |
| PLO12 | - | Uses a foreign language in verbal and written communication at least B2 level of European Language Portfolio. | 3 |
| PLO13 | - | Presents his/her research findings systematically and clearly in oral and written forms in national and international platforms. | 4 |
| PLO14 | - | Understands social and environmental implications of engineering practice. | 3 |
| PLO15 | - | Considers social, scientific and ethical values in the process of data collection, interpretation and announcement of the findings. | 3 |
| PLO16 | - | Works in multi-disciplinary teams, take a leading role and responsibility and develop solutions for complex problems. | 4 |
Week Plan
| Week | Topic | Preparation | Methods |
|---|---|---|---|
| 1 | Introduction. Paths, Trees and Cycles. | reading the related textbook chapter | |
| 2 | Algorithm Design and Analysis. | reading the related textbook chapter | |
| 3 | Shortest Paths: Label Setting Algorithms, Label Correcting Algorithms | reading the related textbook chapter | |
| 4 | Maximum Flows: Basic Ideas and Polynomial Algorithms. | reading the related textbook chapter | |
| 5 | Minimum Cost Flows: Basic Algorithms. | reading the related textbook chapter | |
| 6 | Minimum Cost Flows: Polynomial Algorithms. | reading the related textbook chapter | |
| 7 | Assignments and Matchings | reading the related textbook chapter | |
| 8 | Mid-Term Exam | prepare for the exam | |
| 9 | Minimum Spanning Trees. | reading the related textbook chapter | |
| 10 | Convex Cost Flows. | reading the related textbook chapter | |
| 11 | Generalized Flows. | reading the related textbook chapter | |
| 12 | Multicommodity Flows. | reading the related textbook chapter | |
| 13 | Computational Testing of Algorithms. | reading the related textbook chapter | |
| 14 | Lagrangian Relaxation and Network Optimization. | reading the related textbook chapter | |
| 15 | Project Presentations | prepare for the presentation | |
| 16 | Term Exams | prepare for the exam | |
| 17 | Term Exams | prepare for the exam |