Algorithms, Combinatorics and Optimization

Leader of the group Algorithms, Combinatorics and Optimization (PNA1): Monique Laurent.

The motivation for the research of the group Algorithms, Combinatorics and Optimization comes from society. Real-world problems often ask for searching for an optimum or desirable solution among an infinite, or even finite but astronomically large, number of candidates.

Such problems arise for instance in production and transportation planning, routing, scheduling and timetabling, computational biology, and network economics. Motivated by this algorithmic challenge, the group investigates and develops methods from mathematics (algebra, geometry, graph theory, mathematical logic, topology), mathematical optimization (combinatorial, linear, integer, and semidefinite optimization) and computer science (computational complexity, constraint programming, and algorithmic game theory).

Members
Karen Aardal, Krzysztof Apt, Jarek Byrka, Jan Draisma, Bert Gerards, Dion Gijswijt, Florian Horn, Jan Karel Lenstra, Erik Jan van Leeuwen, Bertrand Meyer, Tobias Mueller , Fernando de Oliveira Filho, Guus Regts, Guido Schaefer , Alexander Schrijver, Floor Sietsma ,Orestis Telelis , Frank Vallentin ,  Antonios Varvitsiotis, Andreas Witzel, Dominik Wojtczak, Jonathan Zvesper and Stefan van Zwam

Former members
List of former members.

Group publications
Publications in CWI repository.

Seminars
Seminar Combinatorics and Optimization.
Working group Algebra and Combinatorics.

Workshops
List of workshops, schools and conferences.

Job openings:

The group is part of the cluster Probability, Networks and Algorithms (PNA).