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
Connection between graph theory and algebra deepened
PhD student Guus Regts from Centrum Wiskunde & Informatica (CWI) investigated mathematical connections between graph theory and algebra.
Nikhil Bansal receives ERC Consolidator Grant for research on algorithms
Mathematician Nikhil Bansal received an ERC consolidator grant in November. The researcher is affiliated with Eindhoven University of Technology and part-time seconded at CWI, in the Networks & Optimization research group.
MINO project on business decisions starts at CWI in October 2013
The Networks & Optimization research group at CWI in Amsterdam participates in the recently funded EU Initial Training Network MINO for Mixed Integer Nonlinear Optimization. It has eleven academic partners(such as CWI and project coordinator Bologna University) and three commercial partners (IBM, MAIOR and ORTEC).
CWI researcher proves famous Rota’s Conjecture
Mathematician Bert Gerards of Centrum Wiskunde & Informatica (CWI) in Amsterdam and his colleagues Jim Geelen (University of Waterloo, Canada) and Geoff Whittle (Victoria University of Wellington, New Zealand) have proved the famous 40-year old Rota’s Conjecture. The team has been working for more than 15 years on solving this mathematical problem posed by Gian-Carlo Rota in 1970.
Members
Associated Members
Publications
-
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
-
Monique Laurent gekozen tot KNAW-lid - Tilburg University - 20-04-18. (2018). Monique Laurent gekozen tot KNAW-lid - Tilburg University - 20-04-18.
-
de Klerk, E, & Laurent, M. (2018). Worst-case examples for Lasserre's measure-based hierarchy for polynomial optimization on the hypercube.
-
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
-
Vici-winnaar TU/e vertrekt naar CWI in Amsterdam - cursor.tue.nl - 01-03-18. (2018). Vici-winnaar TU/e vertrekt naar CWI in Amsterdam - cursor.tue.nl - 01-03-18.
-
Vici-subsidie voor wiskundige Nikhil Bansal - Eindhoven.nieuws.nl - 23-02-18. (2018). Vici-subsidie voor wiskundige Nikhil Bansal - Eindhoven.nieuws.nl - 23-02-18.
-
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
-
Chandrasekaran, K, Dadush, D.N, Gandikota, V, & Grigorescu, E. (2018). Lattice-based locality sensitive hashing is optimal. arXiv.org e-Print archive.
-
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