Applied Discrete Optimization

What it is about

You learn how discrete optimization problems are modeled and solved. The course covers polyhedral foundations, exact procedures (e.g., Branch-and-Bound, Branch-and-Cut, Branch-and-Price, Dantzig–Wolfe, Benders, Lagrange-Relaxation) and heuristic/metaheuristic approaches. In the end you can apply suitable methods (exact or heuristic) to solve complex, large-scale models.

What you will be able to do

• Understanding the complexity of discrete optimization models
• Knowledge of polyhedral theory
• Familiarity with fundamental exact solving procedures
• Familiarity with advanced exact methods (e.g., Branch-and-Cut, Branch-and-Price, Benders, Lagrangian Relaxation)
• Application of suitable solution approaches (exact or heuristic) to practical problems

What the module consists of

• LectureConveying theoretical foundations, examples and applications
• Exercises / group tasksPractical application of the methods and handling real-world application cases; preparation for the assessments
• Discussion of technical professional articlesDeepening specific problems and solution approaches through selected papers

Teaching method

• LectureExplanation of the fundamental theories behind the solution methods and demonstration with examples
• Group tasks / assignmentsPractical exercise of the learned methods and handling of real applications
• Professional article discussionDeepening of special topics and current solution approaches