Warning! The directory is not yet complete and will be amended until the beginning of the term.
040968 UK Graph Algorithms and Network Flows (2014S)
Continuous assessment of course work
Labels
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).
- Registration is open from Mo 17.02.2014 09:00 to Tu 25.02.2014 16:00
- Deregistration possible until Fr 14.03.2014 23:59
Details
max. 30 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
- Wednesday 19.03. 18:00 - 21:00 Hörsaal 9 Oskar-Morgenstern-Platz 1 1.Stock
- Wednesday 02.04. 18:00 - 21:00 Hörsaal 9 Oskar-Morgenstern-Platz 1 1.Stock
- Wednesday 09.04. 18:00 - 21:00 Hörsaal 8 Oskar-Morgenstern-Platz 1 1.Stock
- Wednesday 30.04. 18:00 - 21:00 Hörsaal 9 Oskar-Morgenstern-Platz 1 1.Stock
- Wednesday 07.05. 18:00 - 21:00 Hörsaal 9 Oskar-Morgenstern-Platz 1 1.Stock
- Wednesday 04.06. 18:00 - 21:00 Hörsaal 5 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Wednesday 25.06. 18:00 - 20:00 Hörsaal 5 Oskar-Morgenstern-Platz 1 Erdgeschoß
Information
Aims, contents and method of the course
Assessment and permitted materials
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.
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
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.