Universität Wien FIND
Warning! The directory is not yet complete and will be amended until the beginning of the term.

040968 UK Graph Algorithms and Network Flows (MA) (2017S)

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

Registration/Deregistration

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

Details

max. 30 participants
Language: English

Lecturers

Classes (iCal) - next class is marked with N

Monday 06.03. 09:45 - 11:15 Seminarraum 15 Oskar-Morgenstern-Platz 1 3.Stock
Tuesday 07.03. 09:45 - 11:15 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Tuesday 14.03. 09:45 - 11:15 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday 20.03. 09:45 - 11:15 Seminarraum 15 Oskar-Morgenstern-Platz 1 3.Stock
Tuesday 21.03. 09:45 - 11:15 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday 27.03. 15:00 - 16:30 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
Tuesday 28.03. 09:45 - 11:15 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday 03.04. 15:00 - 16:30 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
Monday 24.04. 15:00 - 16:30 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
Tuesday 25.04. 09:45 - 11:15 Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday 08.05. 15:00 - 16:30 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
Monday 15.05. 15:00 - 16:30 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
Monday 22.05. 15:00 - 16:30 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
Monday 29.05. 15:00 - 16:30 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock

Information

Aims, contents and method of the course

Networks are apparent in our daily lives. Typical examples of networks are:
electrical and power networks, telephone or Internet data networks, traffic net-
works (highways, rail networks, airline service networks), manufacturing and
distribution networks, or even social networks.
Graphs are used to model networks, and the underlying optimization problems are solved by means of graph algorithms.

Assessment and permitted materials

written exam

Minimum requirements and assessment criteria

This course should help graduate students to:
a) understand information about networks, and
b) develop mathematical models and algorithms to design networks.
In particular the main aims of the course are to:
- provide the knowledge of the fundamental concepts of networks
- provide the knowledge of the fundamental concepts of integer programming
- learn skills in mathematical modeling of optimization problems on networks
- learn skills in developing algorithmic techniques.

Examination topics

Reading list


Association in the course directory

Last modified: Mo 07.09.2020 15:29