About Us

Our group focuses, in research and teaching, on combinatorial optimization. We analyze the structure of such problems and design efficient algorithms with provable performance guarantees for solving them. We are also interested in solving such problems under incomplete information and develop online, stochastic or robust solution methods. We contribute with theoretic results and apply them to complex real-world environments. Typical application areas are scheduling, production planning, logistics, network design, communication and routing in networks, and health care.



Open positions

We have open Ph.D. and Postdoc positions in the area of combinatorial optimization and efficient algorithms. Applicants must have a strong mathematical background. Please send your electronic application to Nicole Megow.