040968 UK Graph Algorithms and Network Flows (MA) (2018S)
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 We 14.02.2018 09:00 to We 21.02.2018 12:00
- Deregistration possible until We 14.03.2018 23:59
Details
max. 30 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
Monday
05.03.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
07.03.
11:30 - 13:00
Seminarraum 6 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
14.03.
11:30 - 13:00
Seminarraum 6 Oskar-Morgenstern-Platz 1 1.Stock
Monday
19.03.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday
09.04.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday
16.04.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday
23.04.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday
30.04.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
02.05.
11:30 - 13:00
Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
Monday
07.05.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Wednesday
09.05.
11:30 - 13:00
Seminarraum 6 Oskar-Morgenstern-Platz 1 1.Stock
Monday
14.05.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday
28.05.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday
04.06.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday
11.06.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday
18.06.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.Stock
Monday
25.06.
15:00 - 16:30
Seminarraum 3 Oskar-Morgenstern-Platz 1 1.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 networks (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.
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