| Description
| This course teaches the students theoretical background on some popular network models with applications in transportation industry. Both approaches based on mathematical programming and graph theory will be discussed. Models to be investigated are: (1) Shortest Distance and Minimum Spanning Tree, (2) Traveling Salesman Problem (Node Covering Problem), (3) Chinese Postman's Problem (Edge Covering Problem), (4) Vehicle Routing Problem, (5) Median Problem, (6) Central Problem. (7) Plant Location Problem, and (8) Set Covering Problem.
|
|---|