Theory of Graph and Network Optimization

Theorie der Graphen- und Netzwerkoptimierung

Cycle:

Winter

Language:

German

Credits:

9

Contact:

tgno@combi.rwth-aachen.de

Regular Courses:

  • Mathematics M.Sc.
  • Data Science M.Sc.
  • Computer Science M.Sc. / Anwendungsbereich Mathematics

Exam:

  • Exam Type: Oral
  • Exam Requirements: Solving and presentation of several excercises throughout the term

Team

Christina Büsing
buesing@combi.rwth-aachen.de
  • Robust Optimisation
  • Combinatorial Optimisation
  • Healthcare Applications
Mariia Anapolska
anapolska - at - combi.rwth-aachen.de
  • Appointment Assignment
  • Scheduling Problems
  • Flows over Time

Content

Combinatorial algorithms are an important class of efficient algorithms to solve discrete optimization problems. In the course Optimization B, classical examples are discussed such as Dijkstra's algorithm for the shortest path problem or Ford and Fulkerson's algorithm for the maximum flow problem. In this course, we investigate extensions of these algorithms to efficiently solve more complex optimization problems such as the constraint shortest path problem.

Learning Targets

Participants learn about extensions of common combinatorial algorithms and their application to optimization problems with resource limitations and time components. They acquire the ability to model complex questions from practice, to assess the limits and possibilities of known methods, to develop new solution methods and to classify the complexity of optimization problems.

Recommended Prerequisites

Knowledge in discrete and combinatorial optimization, especially complexity of algorithms and graph theory (recommended courses are e.g. Optimization B or Graph Theory I).

Further Information

Students from the business faculty who wish to take a 5CP exam, please contact the course advisors at the beginning of the term. Furthermore, note that this is an advanced Master's course in mathematics. It is not implossible, but rather challenging to take this with only QM/OR1 as background.
🔝