Concepts and algorithms in the area of combinatorial optimization with main focus on integer linear programming.

Course based on Algorithms and Data Structures 1 and 2, algorithms from the area of combinatorial optimization, linear programming, and integer linear programming. Didactics: - weekly lecture - 2 exercise sheets - one programming exercise - oral exam

oral exam at the end of the course. To achieve a passing grade at least 50% of the exercises as well as the programming exercise need to be solved.

No special modalities.

The slides of the lecture as well as the exercises will be available here.

Requirements:

• knowledge of basic algorithms and data structures
• programming skills in Java or C++
• knowledge of linear algebra and analysis, especially set theory, metrics, sequences and series