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 (max-flow, maximal  matchings etc.)
  • NP-Completeness and -Hardness
  • Algorithmic Treatment of NP-hard Problems (travelling salesman, Knapsack, SAT, Scheduling Problems …)