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
Marie Curie ITN grant awarded to POEMA network
Recently, the EU awarded a Marie Skłodowska-Curie Innovative Training Networks (ITN) grant for POEMA – ‘Polynomial Optimization, Efficiency through Moments and Algebra’. The consortium consists of 14 academic and industrial partners, such as CWI, Tilburg University, Inria and IBM.
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.
Current events
Early bird registration NMC 2019: deadline 31 December 2019
- 2019-04-23T09:00:00+02:00
- 2019-04-24T18:00:00+02:00
Early bird registration NMC 2019: deadline 31 December 2019
Start: 2019-04-23 09:00:00+02:00 End: 2019-04-24 18:00:00+02:00
On April 23-24, 2019, the Dutch Mathematical Congress (NMC 2019) will be held in the Congress Centre Koningshof (located in Veldhoven, close to Eindhoven).
Given the success of the first "NMC new style" earlier this year, we hope that in 2019 there will be even more participants. Once again we have compiled a very attractive programme with the following ingredients:
Plenary lectures by Barbara Gentz, Jan Hesthaven, Gábor Lugosi and Anke van Zuylen
Parallel sessions by the Gravitation programmes Networks and Quantum Software Consortium, and of pairs of clusters inspired by the new topics in the “Sectorplan”
A strategy session on the cluster evaluation and the “Sectorplan”
Speed dates with industry
Poster prize, KWG prize for PhD students, the Stieltjes prize and the new “innovation” prize for MSc students
Social programme with dinner and dance performance based on the ‘spurs of Lehmer’
The "early bird" registration period, giving you a discount of € 50,-, ends December 31st, so register now!
You can find more information and a link to the registration form.
With regards,
On behalf of the organising committee,
Evgeny Verbitsky (chair)
Members
Associated Members
Publications
-
Monaco, G, Moscardelli, L, & Velaj, Y. (2018). Hedonic games with social context. In Proceedings of the 19th Italian Conference on Theoretical Computer Science (pp. 24–35).
-
Amanatidis, G, Christodoulou, G, Fearnley, J, Markakis, V, Psomas, C.-A, & Vakaliou, E. (2018). An improved envy-free cake cutting protocol for four agents. In Proceedings of International Symposium on Algorithmic Game Theory (pp. 87–99). doi:10.1007/978-3-319-99660-8_9
-
Groenland, C, & Schäfer, G. (2018). The curse of ties in congestion games with limited lookahead. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS (pp. 1941–1943).
-
de Klerk, E, & Laurent, M. (2018). Comparison of Lasserre's measure-based bounds for polynomial optimization to bounds obtained by simulated annealing. Mathematics of Operations Research, 1–9. doi:10.1287/moor.2017.0906
-
Gribling, S.J, de Laat, D, & Laurent, M. (2018). Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. Mathematical Programming, 170(1), 5–42. doi:10.1007/s10107-018-1287-z
-
Kleer, P.S, & Schäfer, G. (2018). Tight inefficiency bounds for perception-parameterized affine congestion games. Theoretical Computer Science. doi:10.1016/j.tcs.2018.04.025
-
Apt, K.R, & Shoja Talatappeh, E. (2018). Self-stabilization through the lens of game theory. In F.S de Boer, M.M Bonsangue, & J.J.M.M Rutten (Eds.), It's All About Coordination. Essays to Celebrate the Lifelong Scientific Achievements of Farhad Arbab (pp. 21–37). doi:10.1007/978-3-319-90089-6_2
-
Geelen, J, Gerards, A.M.H, & Whittle, G. (2018). Quasi-Graphic Matroids (retracted). Journal of Graph Theory, 87(2), 265–265. doi:10.1002/jgt.22143
-
Chandrasekaran, K, Dadush, D.N, Gandikota, V, & Grigorescu, E. (2018). Lattice-based locality sensitive hashing is optimal. In Leibniz International Proceedings in Informatics, LIPIcs (pp. 42:1–42:18). doi:10.4230/LIPIcs.ITCS.2018.42
-
Dadush, D.N, Guzman, C, & Olver, N.K. (2018). Fast, deterministic and sparse dimensionality reduction. In Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1330–1344).
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