| Number |
Approval Talk |
Talk |
Name |
Topic |
Mentoring |
| 1
| 13.4.
| 27.4.
| Jonas Ferel
| TSP with time windows [BBCM]
|
|
| 2
| 20.4.
| 4.5.
| Jason Hahn
| O(log n)-approximation for directed orienteering [NR]
|
|
| 3
| 27.4.
| 11.5.
| Olesia Gaiduk
| An LP for directed latency [BM, Sections 2,3,4]
|
|
| 4
| 4.5.
| 18.5.
| Doris Obermaier
| Rounding the directed latency LP [BM, Sections 2,5,6]
|
|
| 5
| 11.5.
| 1.6.
| Paul Jin Robaschik
| Reduction to vehicle routing with target groups [BTV, Sections 2-3]
|
|
| 6
| 18.5.
| 8.6.
| Roxana Mittelberg
| LP-based algorithm for target groups [BTV, Section 5-6]
|
|
| 7
| 1.6.
| 15.6.
| Stefan Michel
| Better tour splitting for unsplittable instances: the δ-tank lemma [FMRS]
|
|
| 8
| 8.6.
| 22.6.
| Fridolin Weisser
| Euclidean capacitated vehicle routing 1 [FGM, Sections 1-2]
|
|
| 9
| 15.6.
| 29.6.
| Erik Rinas
| Euclidean capacitated vehicle routing 2 [FGM, Sections 3-4]
|
|
| 10
| 22.6.
| 6.7.
| Moritz Reyer
| Vehicle routing on trees [MZ]
|
|
| 11
| 29.6.
| 13.7.
| Martin Brath
| Multi-depot capacitated vehicle routing [FM]
|
|
| 12
| 6.7.
| 20.7.
| Lukas Wiedmann
| Dial-a-ride problem [GHNR]
|
|