Section outline

►Student presentations

  • In this seminar, we look at standard combinatorial problems like shortest path problems, knapsack, etc in cases where the inout parameters are uncertain. We learn about different concepts on how to define "optimality" under uncertainty, and a how to find such "optimal" solutions algorithmically.

    As usual for seminars, in the session the students will present an academic paper on the topic and write a report.

    The courses AGT/GudO (or similar introductions to optimization and algorithms on graphs) are prerequisites for this seminar.

    If interested, please sign in for the WueCampus course using password OuU.

►Student presentations