SS24: Robust Optimization/Algorithms for Optimization under Uncertainty, Sezione: Topic 2

including instructions for the presentations & report, grading criteria etc

https://wuecampus.uni-wuerzburg.de/moodle/pluginfile.php/4678051/block_html/content/OuU-FirstSession.pdf

Date	Presentation 1	Presentation 2
8.5.	Introduction to shortest paths (Anne, Victor, Leticia, Julius, Leon)	On the robust shortest path problem (Anne)
15.5.	fällt aus
22.5.	Recoverable robust shortest path problems (Viktor)	Robust discrete optimization and network flows (Leon)
29.5.	Route Planning under Uncertainty: The Canadian Traveller Problem(Leticia)
5.6.	The Canadian Traveller Problem (Julius)	The robust shortest path with interval data (Victor)
12.6.	Introduction to the knapsack problem (Felix, Frederik)	The robust knapsack problem with queries (Felix)
19.6.	An adaptive stochastic knapsack problem (Frederik)

Schema della sezione

- Seleziona attività Reports
  
  Reports Cartella studenti
  
  Bitte bis 4.8.24, 23:59 die Reports als pdf abgeben.
  
  Bitte beachtet die Vorgaben, die wir dazu in der ersten Session besprochen haben (siehe Slides erste Session)

The first session takes place on April 17 at 14:15 in Übungsraum 2. In this session an overview of different concepts to deal with parameter uncertainty in optimization problems will be given. Furthermore, we will discuss presentation setup, expectations, passing criteria, course language etc and make a rough time schedule depending on participant numbers. If you cannot attend the first session but would like to participate in the remainder of the seminar, please let me know by email.

The next sessions will consist of student presentations.

The first presentations will be about different approaches to deal with uncertainty, which we will study on two 'standard' combinatorial optimization problems: the shortest path problem and the knapsack problem.

If we have enough seminar participants, there will be a second set of presentations in which uncertain versions of other optimization problems are presented.

Due to the different sources of uncertainty and the different ways that uncertainty can be quantified and handled, there is a very large pool of papers on the topic, even when limiting the choice to specific optimization problems.

The following papers could form a good basis for the first set of presentations:

Papers on uncertain shortest path problems:

Papers on uncertain knapsack problems:

To succesfully participate in this seminar, you should have a basic knowledge of algorithms and integer linear programming, as obtained in the courses ADS and AGT or GudO.

For reading some of the papers, more extensive knowledge on topics like advanced algorithms, integer programming, complexity, approximation algorithms, online algorithms, randomized algorithms, probability theory etc would be useful. Your preknowledge will be taken into account when presentation topics/papers are assignment.

Presentations should be targeted to students without this specialized knowledge, i.e., non-basic concepts should be explained in the presentations so that everyone can follow.

Please use the link https://forms.gle/xBApo73qTBiAw7bi9 and follow the instructions given there to indicate your preferences until Friday at noon (12 am).

Please send your slides 10 days before the presentation and meet me right after the seminar in the week before. Where this is not possible, we can arrange another date by email.

If there are additional questions, you can ask them in the discussion forum (if they are brief and potentially interesting for everyone) or book a meeting time slot here: https://doodle.com/meeting/participate/id/enNgrwDe (please make sure that no one else has booked the slot, I can't make the selection exclusive). it helps if you send me your question(s) beforehand, then I can, e.g., look at the corresponding part of the paper in advance.

Impressum | Kontakt | Datenschutzerklärung - WueCampus | Erklärung zur Barrierefreiheit | Bildnachweise