Combinatorial Optimization Group
Our research focuses on discrete optimization problems arising in network design, graph theory, scheduling, logistic and planning. We design efficient algorithms with provable guarantees on the quality of constructed solutions. We apply and develop methods from different branches of mathematics and theoretical computer science, such as mathematical programming, combinatorics, and algorithm theory.
Our areas of expertise include:
- approximation algorithms for NP-hard graph problems
- online algorithms for network problems
- algorithms for traveling salesperson problems
- structure of graph matchings
- online algorithms for scheduling problems
- rounding linear programming relaxations
- algorithmic game theory
Closed calls
- Another post-doc position within the project Algorithmic fundamentals of supply chain networks. See announcement for more details.
- One post-doc position within the project Algorithmic fundamentals of supply chain networks. See announcement for more details.
- One post-doc position within the project Algorithmic fundamentals of supply chain networks and one within the project Algorithmic online optimization for graph problems. See announcement for more details.
- Two PhD and one post-doc position within the project Algorithmic fundamentals of supply chain networks. See announcement for more details.