The research group Mathematical Optimization Methods complements the application-specific projects of the department by developing and implementing algorithms for abstract classes of mathematical optimization problems. Our main focus are methods from integer programming, which allow to model and optimize over yes/no decisions and indivisible goods under constrained resources. Our prime interest lies in innovative algorithms that provide provable guarantees on the solution quality even for highly complex problems for which globally optimal solutions are difficult to compute within time limitations relevant in practice.