Graduate Seminar on Discrete Optimization

Graduate Seminar on Discrete Optimization (S4C1)

Class hours: Mondays 14:15-15:45. Approval talks: 16:15-17:45

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

A regular participation in the talks and an active collaboration are mandatory for passing the seminar.
The talks will take approximately 75 minutes. The remaining 15 minutes are intended for a discussion.
Each participant has to write a summary consisting of one or two pages.
Each participant has to give an approval talk (typically three weeks before the regular talk). Passing the approval talk is a prerequisite for giving the regular seminar talk.

All discrete mathematics lecturers