BAHÇEŞEHİR UNIVERSITY BİLGİ PAKETİ / DERS KATALOĞU
| ELECTRIC-ELECTRONIC ENGINEERING (ENGLISH, PHD) | |||||
| PhD | TR-NQF-HE: Level 8 | QF-EHEA: Third Cycle | EQF-LLL: Level 8 | ||
Course Introduction and Application Information
| Course Code | Course Name | Semester | Theoretical | Practical | Credit | ECTS |
| INE6204 | Network Optimization | Spring | 3 | 0 | 3 | 12 |
| This catalog is for information purposes. Course status is determined by the relevant department at the beginning of semester. |
Basic information
| Language of instruction: | English |
| Type of course: | Departmental Elective |
| Course Level: | |
| Mode of Delivery: | Face to face |
| Course Coordinator : | |
| Recommended Optional Program Components: | N.A. |
| Course Objectives: | This course aims to study the fundamentals of graphs and networks, network optimization problems, and applications, to model discrete optimization problems with graphs, to present a range of algorithms available to solve network flow problems, to help each student develop his or her intuition about algorithm design. |
Learning Outcomes
|
The students who have succeeded in this course; I. Gain the ability to recognize the network structure in a problem and model it as a network optimization problem. II. Solve network optimization problems using appropriate methods. III. Recognize the most widely used network optimization problems such as shortest path, minimum cost flow, minimum spanning tree and maximum flow. IV. Analyze the computational complexity of a given algorithm and explore opportunities for improvement. |
Course Content
| This course will provide an integrated view of the theory, algorithms, and the applications of key network optimization problems including the shortest path problem, the maximum flow problem, the minimum cost flow problem, the minimum spanning tree problem, and the multi-commodity flow problem. |
Weekly Detailed Course Contents
| Week | Subject | Related Preparation |
| 1) | Introduction, Network Notation, Data Structure | |
| 2) | Algorithm Design and Analysis (NP-Completeness) | |
| 3) | Shortest Path and Algorithms I | |
| 4) | Shortest Path and Algorithms II | |
| 5) | Maximum Flows I | |
| 6) | Maximum Flows II | |
| 7) | Minimum Cost Flows I | |
| 8) | Minimum Cost Flows II | |
| 9) | Midterm | |
| 10) | Minimum Spanning Trees | |
| 11) | Multi-commodity Flows | |
| 12) | Assignment and Matching Problems | |
| 13) | Network Simplex | |
| 14) | Project Presentations |
Sources
| Course Notes / Textbooks: | "Network Flows, Theory, Algorithms and Applications", R. Ahuja, T. Magnanti, J. Orlin, 1993 ISBN: 978-0136175490 |
| References: | N.A. |
Evaluation System
| Semester Requirements | Number of Activities | Level of Contribution |
| Presentation | 1 | % 5 |
| Total | % 5 | |
| PERCENTAGE OF SEMESTER WORK | % 5 | |
| PERCENTAGE OF FINAL WORK | % | |
| Total | % 5 | |
ECTS / Workload Table
| Activities | Number of Activities | Duration (Hours) | Workload |
| Course Hours | 13 | 3 | 39 |
| Study Hours Out of Class | 3 | 20 | 60 |
| Presentations / Seminar | 1 | 1 | 1 |
| Project | 1 | 40 | 40 |
| Homework Assignments | 3 | 15 | 45 |
| Midterms | 1 | 3 | 3 |
| Final | 1 | 3 | 3 |
| Total Workload | 191 | ||
Contribution of Learning Outcomes to Programme Outcomes
| No Effect | 1 Lowest | 2 Low | 3 Average | 4 High | 5 Highest |
| Program Outcomes | Level of Contribution |