| 1 |
Getting to know students, subject goals and applications, teaching refrences, getting to know work fields |
|
| 2 |
Network Flow Problem |
|
| 3 |
The Minimal Cost Network Flow Problem |
|
| 4 |
The Shortest Path Problem |
|
| 5 |
The Maximal Flow Problem |
|
| 6 |
Algorithms for The Shortest Path Problem and The Maximal Flow Problem |
|
| 7 |
The Transportation Problem |
|
| 8 |
The Transportation Problem |
|
| 9 |
The Assignment Problem |
|
| 10 |
Introduction in Algorithms |
|
| 11 |
Trees |
|
| 12 |
Maximal Flow-Minimum Cut Theorem |
|
| 13 |
Ford and Fulkerson Algorithm |
|
| 14 |
Kruskal Algorithm |
|
| 15 |
Prim Algorithm |
|
| 16 |
Dijkstra Algorithm |
|
| 17 |
Midterm |
|
| 18 |
Implementation in GAMS |
|
| 19 |
Implementation in GAMS |
|
| 20 |
Introduction to Fuzzy Logic |
|
| 21 |
Introduction to Fuzzy Logic |
|
| 22 |
Selected Papers in Network Problems |
|
| 23 |
Introduction to Fuzzy Logic |
|
| 24 |
Selected Papers in Network Problems |
|
| 25 |
Selected Papers in Network Problems |
|
| 26 |
Selected Papers in Network Problems |
|
| 27 |
Seminar and Discussion |
|
| 28 |
Seminar and Discussion |
|
| 29 |
Seminar and Discussion |
|
| 30 |
Seminar and Discussion |
|
| 31 |
Seminar and Discussion |
|
| 32 |
Seminar and Discussion |
|