In this course, we will first concentrate on network flow problems (max flow, min cost flow, etc...). Our focus will be on the modelling part but we will also see how to solve such problems efficiently using well-known algorithms.
The second part is dedicated to the transportation problem. We will present three algorithms (heuristic, approximation algorithm, exact algorithm) to solve this problem. We then focus on a special case of the transportation problem, called the assignment problem, a present an exact algorithm (Hungarian method) to solve it efficiently.
In the last part, we introduce project management/scheduling problems, present the critical path method as well as the concept of crashing. We also focus on the case when the exact durations of the tasks to be executed are not known.
All topics will be illustrated by examples taken from economics, management science and operations research.
Objectives:
- Be able to model and solve real world problems using network flow techniques.
- Be able to model problems as transportation problems and apply the algorithms seen in class.
- Be able to solve project management problems using the CP method as well as understand the concept of crashing.
- Enseignant·e: Narmina Baghirova
- Enseignant·e: Elise Bangerter
- Enseignant·e: Bernard Ries