040968 UK Graph Algorithms and Network Flows (2013S)
Prüfungsimmanente Lehrveranstaltung
Labels
An/Abmeldung
Hinweis: Ihr Anmeldezeitpunkt innerhalb der Frist hat keine Auswirkungen auf die Platzvergabe (kein "first come, first served").
- Anmeldung von Sa 09.02.2013 09:00 bis Fr 22.02.2013 14:00
- Anmeldung von Mi 27.02.2013 09:00 bis Do 28.02.2013 17:00
- Abmeldung bis Do 14.03.2013 23:59
Details
max. 30 Teilnehmer*innen
Sprache: Englisch
Lehrende
Termine
Zur Zeit sind keine Termine bekannt.
Information
Ziele, Inhalte und Methode der Lehrveranstaltung
Art der Leistungskontrolle und erlaubte Hilfsmittel
Mindestanforderungen und Beurteilungsmaßstab
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.
Prüfungsstoff
Literatur
Zuordnung im Vorlesungsverzeichnis
Letzte Änderung: 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.The lecture covers several NP-hard optimization problems on graphs whose application are known in the design of service networks (e.g., telecommunication, gas, or water supply), in the transportation or logistics. Among others, problems like (delay- or diameter-constrained) Steiner trees, traveling salesman problem, vehicle routing (with diameter and precedence constraints) will be studied.DI 05.03.2013 13.00-17.00 Ort: Hörsaal DAC Universitätsstraße 5 Hochparterre; DO 07.03.2013 09.00-13.00 Ort: Hörsaal DAC Universitätsstraße 5 Hochparterre; FR 08.03.2013 08.30-12.00 Ort: Hörsaal DAC Universitätsstraße 5 Hochparterre; DI 23.04.2013 12.00-14.00 Ort: Hörsaal DAC Universitätsstraße 5 Hochparterre; DI 23.04.2013 16.00-17.00 Ort: Hörsaal DAC Universitätsstraße 5 Hochparterre; MI 24.04.2013 09.00-12.30 Ort: Hörsaal DAC Universitätsstraße 5 Hochparterre; DO 25.04.2013 09.00-12.30 Ort: Hörsaal DAC Universitätsstraße 5 Hochparterre