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.

• Mondays, 10:15 – 11:45 in building B6 room A1.01.
   

The lecture slides and videos as well as the exercise sheets and their corresponding solutions are available in the lecture's ILIAS course. You will be added automatically during the first week if you join the course via Portal2.