BWiWi 4.4 Combinatorial Optimisation - methods and models in Operation Research
Dates:
Lecture: Thursdays, 14:00 - 16:00 in room I.14.60
Start: 15.10.2026
and Mondays, 14:00 - 16:00 in room I.14.60
Start: 19.10.2026
Tutorial: Wednesdays, 14:00 - 16:00 in room I.14.75
Start: 21.10.2026
All information about the course can be found in the Moodle course.
Course: Combinatorial Optimization
Enrolment code: CO2027
Lecture: Prof. Dr. Stefan Bock
Exercise: Cedric Renner (M. Sc.)
Contents:
- Linear programming
- Duality
- Complexity considerations (revised simplex, Dantzig/Wolfe decomposition)
- The Hitchcock transport problem
- The primal-dual simplex algorithm
- Solution methods for shortest path problems
- Maximum flow problems and solution methods
- Alpha-Beta Algorithm
- Integer programming
- Matrix games
Qualification goals:
The aim of the module is to teach basic ways of thinking, contexts and techniques of Operations Research, which enable students to analyse and solve decision problems in business and administration in a targeted quantitative manner.
Another important task of the module is to create the prerequisites required for further scientific and practical work with methods and models of operations research.
Students model and solve business management problems with the help of linear programming; they acquire knowledge of the diverse possibilities of representing decision problems with the help of graphs and are enabled to use effective instruments to solve associated network flow problems or path problems.
In addition, students acquire expertise in solving integer problems.
