Universität Wien FIND

Bedingt durch die COVID-19-Pandemie können kurzfristige Änderungen bei Lehrveranstaltungen und Prüfungen (z.B. Absage von Vor-Ort-Lehre und Umstellung auf Online-Prüfungen) erforderlich sein. Melden Sie sich für Lehrveranstaltungen/Prüfungen über u:space an, informieren Sie sich über den aktuellen Stand auf u:find und auf der Lernplattform moodle. ACHTUNG: Lehrveranstaltungen, bei denen zumindest eine Einheit vor Ort stattfindet, werden in u:find momentan mit "vor Ort" gekennzeichnet.

Regelungen zum Lehrbetrieb vor Ort inkl. Eintrittstests finden Sie unter https://studieren.univie.ac.at/info.

040127 KU Transportation Logistics (MA) (2020W)

4.00 ECTS (2.00 SWS), SPL 4 - Wirtschaftswissenschaften
Prüfungsimmanente Lehrveranstaltung

The course language is English.

Only students who signed up for the class in univis/u:space are allowed to take the class (that means, that you have to at least be on the waiting list if you want to take this class). No exceptions possible.


Hinweis: Ihr Anmeldezeitpunkt innerhalb der Frist hat keine Auswirkungen auf die Platzvergabe (kein "first come, first serve").


max. 60 Teilnehmer*innen
Sprache: Englisch


Termine (iCal) - nächster Termin ist mit N markiert

Montag 05.10. 15:00 - 16:30 Digital
Montag 12.10. 15:00 - 16:30 Digital
Montag 19.10. 15:00 - 16:30 Digital
Montag 09.11. 15:00 - 16:30 Digital
Montag 16.11. 15:00 - 16:30 Digital
Montag 23.11. 15:00 - 16:25 Digital
Montag 30.11. 15:00 - 16:30 Digital
Montag 07.12. 15:00 - 16:30 Digital
Montag 14.12. 15:00 - 16:30 Digital
Montag 11.01. 15:00 - 16:30 Digital
Montag 18.01. 15:00 - 16:30 Digital
Montag 25.01. 15:00 - 16:30 Digital
Donnerstag 28.01. 18:30 - 20:00 Hörsaal 6 Oskar-Morgenstern-Platz 1 1.Stock


Ziele, Inhalte und Methode der Lehrveranstaltung

This course is an introduction to some optimisation problems that appear in Transportation Logistics. Along the semester, we will cover several of these problems, and study their corresponding mathematical formulations and solution methods.
Among the problems we will study: classical network problems (minimum spanning tree, shortest paths, maximum flows), warehouse location problem and its capacitated version, transportation problem, assignment problem, knapsack problem, orienteering, traveling salesman and vehicle routing problems, and maybe others.
Among the methods we will learn: combinatorial algorithms, modelling and solving network problems as linear programs, simplex, dynamic programming, and (for the harder problems), branch-and-bound. For some of the hard problems, we will also discuss construction and improvement heuristics.
This course is broad rather than deep, which means that we emphasise covering a good number of problems and methods, without spending too much time in any of them. The focus is on learning methods, and developing intuition behind why they work.

Art der Leistungskontrolle und erlaubte Hilfsmittel

2 exams, each corresponding to 40% of the final grade.
Several homeworks to be announced every week, and handed in in the beginning of the following class. These account for the remaining 20% of the grade.

Mindestanforderungen und Beurteilungsmaßstab

Students should be familiar with Excel (in special, the Solver), and have basic knowledge about linear programming (i.e., understand a LP formulation, and how to apply the simplex method).
This course requires a somewhat higher level of abstraction, when compared to a Bachelor course. Students are expected to spend around 1-2 hours per week in out-of-class studies (reviewing the content, and preparing the homeworks).



Slides will be available through Moodle, and are sufficient for covering all the content of the course.
For a quick review of linear programming, including the simplex method, students are referred to:
Hillier, Lieberman. Introduction to Operations Research. Chapters 1-5.
(Optional!) For a deeper and more rigorous understanding of many of the methods we see in this course, students are referred to:
Bertsimas, D., Tsitsiklis, J. Introduction to Linear Optimization.

Zuordnung im Vorlesungsverzeichnis

Letzte Änderung: Mo 05.10.2020 10:08