Mixed Integer Programming and Graph Algorithms for Engineering Problems

What it is about

In this module you will learn to formulate technical problems as abstract models (e.g. graphs or sets) and to solve them systematically with algorithms or mathematical models. In the end you will be able to analyze problem and solution spaces, select appropriate procedures, and assess their runtime as well as solution quality.

What you will be able to do

• Abstract modeling of technical problems (graphs, sets, scheduling)
• Application of Mixed Integer Linear Programming (MILP) for engineering tasks
• Use and understanding of classical graph algorithms (e.g. Dijkstra, Kruskal, A*)
• Knowledge of optimization and combinatorics problems (e.g. Set Cover, Steiner Tree)
• Analysis of time complexity and evaluation of solution quality
• Recognize how small formulation changes influence the solution strategy

What the module consists of

• LecturesConveying the theoretical foundations
• Exercises / TutorialsApplication and deepening through tasks and examples

Teaching method

• Lecture (teacher-centered)Conveying the theory
• Tutorials with application tasksConsolidation of what has been learned through practical problem solving and interaction