Discrete Optimization

In this course you learn specific methods to model and solve problems where some objective function shall be maximized or minimized under side constraints, especially for discrete problems, i.e., such with countable objects and integer variables. After the course you should be able to; dualize optimization problems (LP dual, Lagrange dual) and use the dual forms, e.g., to obtain bounds, apply techniques for the design of exact algorithms (dynamic programming, cutting planes, column generation, parameterized algorithms) to concrete problems, distinguish approximation algorithms from heuristics, apply several heuristic approaches (e.g., branch-and-bound) as well as design techniques for approximation algorithms, to concrete problems distinguish approximation algorithms from heuristics, apply several heuristic approaches (e.g., branch-and-bound) as well as design techniques for approximation algorithms, to concrete problems etc.