Nr. |
Datum |
Name |
Thema |
Betreuung |
1 | 23. 4.
| Benjamin Seyfferth
| Goldberg, Rao: Beyond the flow decomposition barrier.
Journal of the ACM, 1998, Volume 45, 783 - 797.
| Jürgen Werber
|
2 | 30.4.
| Thomas Loraing
| Ford, Fulkerson: Constructing maximal dynamic flows from static flows.
The Journal of the Operations Research Society of America 6, 1958, 419 - 433.
| Sven Peyer
|
3 | 7. 5.
| Thomas Boje
| Burkard, Dlaska, Klinz: The quickest flow problem.
ZOR Methods and Models of Operations Research 37, 1993, 31 - 58.
| Stephan Held
|
4 | 14. 5.
| Rüdiger Schmedding
| Klinz, Woeginger: Minimum cost dynamic flows: the series-parallel case.
In: E. Balas and J. Clausen (eds.), Integer Programming and Combinatorial Optimization,
Lecture Notes in Computer Science 920, Springer, Berlin, 1995, 329 - 343.
| Stephan Held
|
5 | 21. 5.
| Uwe Schuster
| Hoppe, Tardos: The quickest transshipment problem. Mathematics of Operations Research 25, 2000, 36 - 62; bis Abschnitt 4.
| Ulrich Brenner
|
6 | 28. 5.
| Rebecca Reiffenhäuser
| Hoppe, Tardos: The quickest transshipment problem. Mathematics of Operations Research 25, 2000, 36 - 62; ab Abschnitt 5.
| Ulrich Brenner
|
7 | 11. 6.
| Stefanie Berrenberg
| Fleischer, Skutella: Quickest flows over time, bis Abschnitt 4.1
| Jens Maßberg
|
8 | 18. 6.
| Sebastian Mänz
| Fleischer, Skutella: Quickest flows over time, ab Abschnitt 4.2
| Jens Maßberg
|
9 | 2. 7.
| Dirk Schiele
| Köhler, Langkau, Skutella: Time-Expanded Graphs for Flow-Dependent Transit Times
| Ulrich Brenner
|
10 | 9. 7.
| Alexander Kleff
| Köhler, Skutella: Flows over time with load-dependent transit time
| Dirk Müller
|