Description
Leader of the group Networks and Optimization: Guido Schäfer.
In today’s society, complex systems surround us. From transport and traffic, to behavioral economics and operations management, real-world applications often demand that we identify simple, optimal solutions among a huge set of possibilities. Our research group Networks and Optimization (N&O) does fundamental research to tackle such challenging optimization problems.
We develop algorithmic methods to solve complex optimization problems efficiently. Our research provides efficient algorithms to some of the most challenging problems, for example, in planning, scheduling and routing. To come up with the best optimization algorithms, we combine and extend techniques from different disciplines in mathematics and computer science.
N&O covers a broad spectrum of optimization aspects. Our expertise ranges from discrete to continuous optimization and applies to centralized and decentralized settings. We focus on both problem-specific methods and universal toolkits to solve different types of optimization problems. The key in our investigations is to understand and exploit combinatorial structures, such as graphs, networks, lattices and matroids. Our research is of high scientific impact and contributes to various fields.
In several cooperations with industry partners, the algorithmic techniques that we develop in our group have proven useful to solve complex real-world problems. We are always interested in new algorithmic challenges arising in real-world applications and are open to new cooperations.
Watch our group video to get a glimpse of our activities.
Vacancies
PhD students on the subject of Towards a Quantitative Theory of Integer Programming
Centrum Wiskunde & Informatica (CWI) has a vacancy in the Networks & Optimization research group for two talented PhD students, on the subject of Towards a Quantitative Theory of Integer Programming.
Postdoc on the subject of Towards a Quantitative Theory of Integer Programming
Centrum Wiskunde & Informatica (CWI) has a vacancy in the Networks & Optimization research group for a talented Postdoc, on the subject of Towards a Quantitative Theory of Integer Programming.
News
Sophie Huiberts nominated for UU Graduate School of Natural Sciences Thesis Award 2018
Sophie Huiberts, a PhD student at CWI, was one of the three nominees for the Graduate School of Natural Sciences Thesis Award 2018 at Utrecht University.
2018 Women@McKinsey Dissertation Award for Yllka Velaj
CWI researcher and ERCIM Fellow Yllka Velaj has won the 2018 Women@McKinsey Dissertation Award for her PhD thesis, which analyzes the problem of how to maximize the dissemination of information and opinions in social networks. The award comes with a job offer by McKinsey & Company, and a sponsorship to attend the Open Data Science Conference 2018.
Monique Laurent opened World Women in Mathematics event in Rio
Monique Laurent from CWI opened the World Women in Mathematics event (WM)² in Rio de Janeiro with a keynote lecture.
ERC Starting grant for CWI researcher Daniel Dadush
In July, Daniel Dadush (CWI) was awarded an ERC Starting Grant of 1.5 million euro for his proposal ‘Towards a Quantitative Theory of Integer Programming’. He aims to revolutionize the understanding of integer programming (IP), the most popular method for finding optimal solutions to optimization problems.
Members
Associated Members
Publications
-
van Heuven van Staereling, I.I. (2018). Tree decomposition methods for the periodic event scheduling problem. In OpenAccess Series in Informatics. doi:10.4230/OASIcs.ATMOS.2018.6
-
Carstens, C.J, & Kleer, P.S. (2018). Speeding up switch Markov chains for sampling bipartite graphs with given degree sequence. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018) (pp. 36:1–36:18). doi:10.4230/LIPIcs.APPROX-RANDOM.2018.36
-
Ontwikkelaars A1 spreken zich uit tegen killer robots - DeIngenieur.nl - 19-07-18. (2018). Ontwikkelaars A1 spreken zich uit tegen killer robots - DeIngenieur.nl - 19-07-18.
-
Amanatidis, G, Birmpas, G, & Markakis, V. (2018). Comparing approximate relaxations of envy-freeness. In IJCAI International Joint Conference on Artificial Intelligence (pp. 42–48).
-
Dadush, D.N, & Huiberts, S. (2018). A friendly smoothed analysis of the simplex method. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 214–227). doi:10.1145/3188745.3188826
-
Kamphorst, B. (2018, May 31). Heavy-traffic behaviour of scheduling policies in queues.
-
Apt, K.R, & Wojtczak, D.K. (2018). Verification of distributed epistemic gossip protocols. Journal of Artificial Intelligence Research, 62, 101–132.
-
Amanatidis, G, Green, B, & Mihail, M. (2018). Connected realizations of joint-degree matrices. Discrete Applied Mathematics. doi:10.1016/j.dam.2018.04.010
-
Bansal, N, Kamphorst, B, & Zwart, A.P. (2018). Achievable performance of blind policies in heavy traffic. Mathematics of Operations Research, 43(3), 949–964. doi:10.1287/moor.2017.0890
-
Hu, H, & Laurent, M. (2018). On the linear extension complexity of stable set polytopes for perfect graphs. European Journal of Combinatorics. doi:10.1016/j.ejc.2018.02.014
Current projects with external funding
-
Continuous Methods in Discrete Optimization
-
Networks
-
New Frontiers in Lattice Algorithms and Design
-
Verbeteren van de efficiency en prestatie van logistieke processen in de binnenvaart
-
Wiskundecluster DIAMANT
-
Approximation Algorithms, Quantum Information and Semidefinite Optimization (AQSO)
-
Mixed-Integer Non-Linear Optimisation Applications (MINOA)
-
Vóórkomen en voorkómen van incidenten op het spoor (PPS Prorail)
-
Quantum Software Consortium (QSC)
-
Societal Impact Games (SocialACT)
Related partners
-
Alma Mater Studiorum-Universita di Bologna
-
Alpen-Adria-Universität Klagenfurt
-
CNR Pisa
-
CNRS
-
CTVrede
-
IBM
-
Prorail
-
Rheinische Friedrich-Wilhelmus Universitaet Bonn
-
Stanford University
-
Technische Universität Dortmund
-
Tilburg University
-
Technische Universiteit Eindhoven
-
Technische Universiteit Delft
-
Universiteit Leiden
-
Universiteit van Amsterdam
-
Vrije Universiteit Amsterdam