Optimisation 2 (engl.)

We will study what it means for an optimisation problem to be computationally hard and how to cope with hardness.

Selected topics:

  • P vs NP
  • branch & bound
  • approximation algorithms
  • semidefinite programming


Professor: Henning Bruhn-Fujimoto

Teaching Assistant: Elke Fuchs and Laura Gellert

Time and Place:

Monday 14-16 in N24/226 (lecture)
Tuesday 12-14 in HeHo18 Room 220 (lecture)
Wednesday 14-16 in HeHo18 Room 120 (exercises)