Algorithmics

This course will take place as inverted lecture.

Based on the module Algorithms and Data Structures, this course introduces advanced concepts and algorithms, treating correctness and costs. The focus is on economic applications, i.e., how to describe and solve given practical problems using appropriate algorithms. The question of problems which cannot be computed efficiently (P vs. NP) will be discussed and heuristics for NP-hard optimization problems will be introduced. Treated topics are linear programming, network algorithms, NP-completeness and the algorithmic treatment of NP-hard problems like the satisfiability problem and the travelling salesperson problem.

• 2023–02-07: The first lecture will take place on Monday, 13 February 2023, 10:15 – 11:45 in building B6 room A1.01.
• 2023–02-07: The course website for 2023 is online.

• (Probably) Mondays, 10:15 – 11:45 in building B6 room A1.01.
  (Matthias Krause, Alexander Moch)

The lecture slides and videos as well as the exercise sheets and their corresponding solutions are available in the lecture's ILIAS course.