Course Details
Language | English |
Duration | 5 week |
Effort | 6 hour/week |
Introduction to the mathematical concept of networks, and to two important optimization problems on networks: the transshipment problem and the shortest path problem. Short introduction to the modeling power of discrete optimization, with reference to classical problems. Introduction to the branch and bound algorithm, and the concept of cuts.
The course assumes no prior knowledge of optimization. It relies heavily on linear algebra, analysis and calculus (matrices, derivatives, eigenvalues, etc.)
The knowledge of the programming language Python is an asset to learn the details of the algorithms. However, it is possible to follow the course without programming at all.
The course is structured into 5 sections.
Michel Bierlaire holds a PhD in Mathematical Sciences from the University of Namur, Belgium. Between 1995 and 1998, he was research associate and project manager at the Intelligent Transportation Systems Program of the Massachusetts Institute of Technolog…
Free online courses from École polytechnique fédérale de Lausanne
EPFL is the Swiss Federal Institute of Technology in Lausanne. The past decade has seen EPFL ascend to the very top of European institutions of science and technology: it is ranked #1 in E…
117 instructors