---
title: 'Theory of Graph and Network Optimization'
url: 'https://combi.rwth-aachen.de/en/teaching/courses/theory-of-optimization-of-graphs-and-networks'
markdown: 'https://combi.rwth-aachen.de/en/teaching/courses/theory-of-optimization-of-graphs-and-networks.md'
lang: german
date: '2026-07-25'
---

#  Theory of Graph and Network Optimization 

##  Theorie der Graphen- und Netzwerkoptimierung 

### Cycle:

 Winter 

### Language:

 German 

### Credits:

 9 

### Contact:

 [ tgno@combi.rwth-aachen.de ](mailto: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

 [    ![](https://combi.rwth-aachen.de/images/5/a/e/7/c/5ae7c70c46d2ea20033ae76292f454d15ba80811-christina.jpg)  ](https://combi.rwth-aachen.de/en/team/christina-buesing) 

 [ Prof. Christina Büsing ](https://combi.rwth-aachen.de/en/team/christina-buesing) 

 [  ](mailto:buesing@combi.rwth-aachen.de "Mail") 

 [  ](https://www.researchgate.net/profile/Christina-Buesing "Research Gate Profile") 

 [  ](https://scholar.google.com/citations?user=LgVM_k4AAAAJ&hl=de&oi=ao "Google Scholar Profile") 

 [  ](https://orcid.org/0000-0002-3394-2788 "Orcid Profile") 

 [ buesing@combi.rwth-aachen.de ](mailto:buesing@combi.rwth-aachen.de " mail")- Robust Optimisation
- Combinatorial Optimisation
- Healthcare Applications

 [    ![](https://combi.rwth-aachen.de/images/8/5/d/7/5/85d75ec6ee640afbd7ed4b9067d7044395c6a279-mariia.png)  ](https://combi.rwth-aachen.de/en/team/mariia-anapolska) 

 [ Mariia Anapolska ](https://combi.rwth-aachen.de/en/team/mariia-anapolska) 

 [  ](mailto:anapolska "Mail") 

 [  ](https://www.researchgate.net/scientific-contributions/Mariia-Anapolska-2170997070 "Research Gate Profile") 

 [  ](https://orcid.org/0000-0002-8364-0446 "Orcid Profile") 

 [ anapolska - at - combi.rwth-aachen.de ](mailto:anapolska " mail")- 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.

---

## Navigation

- Parent: [Courses](https://combi.rwth-aachen.de/en/teaching/courses.md)
- Next: [Mathematical Heuristics for Discrete Optimization Problems](https://combi.rwth-aachen.de/en/teaching/courses/mathematical-heuristics-in-discrete-optimisation.md)