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.
News
CWI-mathematician proves: altruism does not necessarily lead to better outcomes in game theory
New mathematical research shows that consideration for others does not always lead to the best outcome - that is, when it’s applied in game theory.
CWI researchers in research consortium Gravity programme
Six research consortia in which prominent scientists from various Dutch universities work together are receiving a combined sum of 153 million euros for long-term and large-scale research.
Conditions for optimal solutions to semidefinite problems found
Most optimization problems in real-life are hard to solve optimally. However, for practical purposes it is usually sufficient to settle for near-optimal solutions that can be found quickly. Fast and more accurate approximations can be computed using semidefinite programming, a novel powerful optimization tool
Current events
CWI-Inria Workshop 2018
- 2018-09-25T13:30:00+02:00
- 2018-09-26T12:00:00+02:00
CWI-Inria Workshop 2018
Start: 2018-09-25 13:30:00+02:00 End: 2018-09-26 12:00:00+02:00
We welcome you to attend the next CWI-Inria workshop. Please visit the website for all information about the program and free registration.
- Web
- Email: Susanne van Dam
- Phone: 020-592 4189
-
iCal
Members
Associated Members
Publications
-
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.
-
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
-
Beurs van 1,5 miljoen voo TU/e-hoogleraar Bansal - E52.nl - 26-02-18. (2018). Beurs van 1,5 miljoen voo TU/e-hoogleraar Bansal - E52.nl - 26-02-18.
-
Geelen, J, Gerards, A.M.H, & Whittle, G. (2018). Quasi-graphic matroids (corrected version of a paper that was previously retracted at the request of the authors). Journal of Graph Theory, 87(2), 253–264. doi:10.1002/jgt.22177
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