Universität Wien FIND

Return to Vienna for the summer semester of 2022. We are planning to hold courses mainly on site to enable the personal exchange between you, your teachers and fellow students. We have labelled digital and mixed courses in u:find accordingly.

Due to COVID-19, there might be changes at short notice (e.g. individual classes in a digital format). Obtain information about the current status on u:find and check your e-mails regularly.

Please read the information on https://studieren.univie.ac.at/en/info.

040711 DK PhD-M: MIP - Solution methods and Applications (2008W)

10.00 ECTS (2.00 SWS), SPL 4 - Wirtschaftswissenschaften
Continuous assessment of course work


Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).


max. 15 participants
Language: English



Currently no class schedule is known.


Aims, contents and method of the course

Part I: Pickup and Delivery Vehicle Routing Problems

The first part of the seminar will cover models and algorithms for pickup and delivery vehicle routing problems. We will first present a classification of the different problems that have been studied in the literature and an overview of the main solution approaches. We will then focus on branch-and-cut and branch-and-price methods for the pickup and delivery problem with time windows. We will also describe some meta-heuristics for this problem. We will finally describe some special cases such as the travelling salesman problem with LIFO loading.

Part II: Benders Decompositions and Applications in Logistics and Transportation

The second part will address some integrated planning problems which are well suited for a primal decomposition approach. We will first introduce the general Benders decomposition methodology. We will then explain its application to three families of problems: the assignment of locomotives and cars to passenger trains, the integrated routing of aircraft and scheduling of crews, and the design of logistics networks. In each case, we will describe the application context and show how Benders decomposition can lead to efficient solution algorithms.

Assessment and permitted materials

Minimum requirements and assessment criteria

Examination topics

Reading list

Association in the course directory

Last modified: Mo 07.09.2020 15:29