Graph Routing and applications (GrRaA)5 ECTS
(englische Bezeichnung: Graph Routing and applications)
(Prüfungsordnungsmodul: Wahlmodul Mathematik)

Lectures:

• • Graph Routing and applications
    (Vorlesung, 4 SWS, Francisco Javier Zaragoza Martínez)
  • Tutorial to Graph Routing and applications
    (Übung, 2 SWS, Francisco Javier Zaragoza Martínez)

Inhalt:

The origins of graph theory are usually traced back to Euler's solution to the famous amusement known as the Königsberg bridges problem, that is, the problem of starting at some point, traversing each bridge exactly once, and returning to the original point. Since then, numerous generalizations and variants of this problem have been proposed. In this course we are going to present some basic graph routing problems (known as the postman problem and the traveling salesman problem), we are going to cover the necessary graph theoretical concepts and mathematical programming techniques used to model these problems (usually as linear integer programs), and we are going to describe algorithmic methods for their solution.

Verwendbarkeit des Moduls / Einpassung in den Musterstudienplan:

1. Computational and Applied Mathematics (Master of Science)
   (Po-Vers. 2017w | NatFak | Computational and Applied Mathematics (Master of Science) | Elective modules (as selected from FAU-modules) | Wahlmodul Mathematik)

Studien-/Prüfungsleistungen:

Klausur: Wahlmodul Mathematik (Prüfungsnummer: 59401)

Untertitel: Graph Routing and applications

Prüfungsleistung, Klausur, Dauer (in Minuten): 60, benotet, 3.0 ECTS

Anteil an der Berechnung der Modulnote: 100.0 %

Erstablegung: WS 2018/2019, 1. Wdh.: WS 2018/2019

1. Prüfer:

Francisco Javier Zaragoza Martínez

Termin: 17.12.2018, 10:00 Uhr

Übungsleistung: Wahlmodul Mathematik (Prüfungsnummer: 59402)

Untertitel: Graph Routing and applications

Studienleistung, Übungsleistung, unbenotet, 2.0 ECTS

weitere Erläuterungen:
wöchentliches Übungsblatt

Erstablegung: WS 2018/2019

1. Prüfer:

Francisco Javier Zaragoza Martínez