The course will not be lectured in 2017-2018.
Lecturer: Enrico Bartolini
Assistant: Juho Andelmin
This course focuses on some
computational aspects of Operations Research and particularly optimization. We
will consider algorithms and speed up techniques for shortest path problems, and
dynamic programming algorithms e.g. for knapsack problems and constrained
shortest path problems. Besides having themselves several applications they appear as sub problems of more complex problems and their solution algorithms
often form the building blocks of the solution methods, such as decomposition methods, for
more complex problems. We will then consider decomposition methods such as
Dantzig-Wolfe decomposition and Benders' decomposition and their application to
some classical problems in logistics and transportation.
The course involves a programming assignment asking to implement one of the