Optimization and OR 2 (engl.)

After concentrating on linear programming, integer linear programming, and some efficiently solvable discrete optimization problems in Optimierung und OR 1, we will focus in Optimierung und OR 2 on algorithmically hard problems, complexity theory, approximation algorithms, and heuristics. Furthermore, we will extend some of the fundamental results of linear programming to more general, and, in particular, convex optimization problems.


  • B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, Springer
  • V.V. Vazirani, Approximation Algorithms, Springer

Professor and Teaching Assistant: Dieter Rautenbach, Maximilian Fürst
Times and Place:

  • Lecture: Tuesdays 10:15-11:45 in He18, 220 and Wednesdays 8:30-10:00 in He18, 220
  • Exercise: Mondays 14:15-15:45 in N24, 226

Prerequisites for the exam ("Vorleistung"): 50% of the reachable points in the exercises as well as active participation during the exercise hours.
Exam: 10:00-12:00 on 15.02.2020 and 17.04.2020
Exercise sheets and further material: moodle.uni-ulm.de/login/index.php


15.10.2019: first lecture
21.10.2019: lecture (instead of 1st exercise)
04.11.2019: first exercise