Description
Leader of the group Networks and Optimization: Daniel Dadush.
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.
Video about our collaboration with ProRail (in Dutch)
Vacancies
No vacancies currently.
News
CWI researchers win Best Paper Award at SPIRE 2022
Wiktor Zuba, Solon Pissis and 4 co-authors were awarded the Best Paper Award of SPIRE 2022 for their paper ‘Subsequence Covers of Words’. Their research has potential applications in bioinformatics and data compression.
CWI Fellow co-edits book about Edsger Wybe Dijkstra
In July 2022, the book 'Edsger Wybe Dijkstra: His Life, Work, and Legacy', edited by CWI Fellow Krzysztof Apt and Tony Hoare, was published. From '52-'62, Turing Award winner Dijkstra worked at CWI (then MC), where he designed a.o. the shortest path algorithm used in all navigation systems.
New mathematical insights on popular optimization methods
The widely used simplex algorithm (1947) is one of the algorithms that work well in practice, while according to the theory, this should not always be possible. Sophie Huiberts (CWI) and her colleagues provided new theoretical solutions for long-standing problems in this area.
Lucas Slot wins 2022 KWG PhD Prize
Lucas Slot, PhD student at CWI, won the annual KWG prize for PhD students for his research and presentation at the Dutch Mathematical Conference (NMC) in 2022.
Members
- Krzysztof Apt
- Sander Borst
- Daniel Dadush
- Willem Feijen
- Esteban Gabory
- Danish Kashaev
- Sophie Klumper
- Zhuan Khye Koh
- Monique Laurent
- Jan Karel Lenstra
- Solon Pissis
- Sven Polak
- Akshay Ramachandran
- Lex Schrijver
- Guido Schäfer
- Andries Steenkamp
- Leen Stougie
- Michelle Sweering
- Simon Jo L Telen
- Samarth Tiwari
- Artem Tsikiridis
- Luis Vargas
- Konstantinos Varsos
- Hilde Verbeek
- Alex Liheng Wang
- Wiktor Zuba
Associated Members
Publications
-
Laurent, M, & Slot, L.F.H. (2022). An effective version of Schmüdgen’s Positivstellensatz for the hypercube. Optimization Letters. doi:10.1007/s11590-022-01922-5
-
Brokkelkamp, K.R, Hoeijmakers, S.L, & Schäfer, G. (2022). Greater flexibility in mechanism design through altruism. In Proceedings of SAGT 2022 (pp. 41–59). doi:10.1007/978-3-031-15714-1_3
-
Laurent, M, & Vargas, L.F. (2022). Exactness of Parrilo’s conic approximations for copositive matrices and associated low order bounds for the stability number of a graph. Mathematics of Operations Research, 1–27. doi:10.1287/moor.2022.1290
-
Schrijver, A. (2022). On the Shannon capacity of sums and products of graphs. Indagationes Mathematicae. doi:10.1016/j.indag.2022.08.009
-
van Beek, A, Brokkelkamp, K.R, & Schäfer, G. (2022). Corruption in Auctions: Social Welfare Loss in Hybrid Multi-Unit Auctions. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (pp. 1283–1291).
-
Apt, K.R, Simon, S.E, & Wojtczak, D.K. (2022). Coordination games on weighted directed graphs. Mathematics of Operations Research, 47(2), 995–1025. doi:10.1287/moor.2021.1159
-
Laurent, M, & Vargas, L.F. (2022). Finite convergence of sum-of-squares hierarchies for the stability number of a graph. SIAM Journal on Optimization, 32(2), 491–518. doi:10.1137/21M140345X
-
Borst, S.J, van Iersel, L.J.J, Jones, M.E.L, & Kelk, S.M. (2022). New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees. Algorithmica. doi:10.1007/s00453-022-00946-8
-
Schäfer, G, & Zweers, B.G. (2021). Maximum coverage with cluster constraints: An LP-based approximation technique. In Proceedings of the 19th International Workshop on Approximation and Online Algorithms (pp. 63–80). doi:10.1007/978-3-030-80879-2_5
-
Dadush, D.N, Koh, Z.K, Natura, B, & Végh, L.A. (2021). An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems. In Annual European Symposium on Algorithms (pp. 36.1–36.15). doi:10.4230/LIPIcs.ESA.2021.36
Current projects with external funding
-
Smart Heuristic Problem Optimization ()
-
Mixed-Integer Non-Linear Optimisation Applications (MINOA)
-
New frontiers in numerical nonlinear algebra (None)
-
Optimization for and with Machine Learning (OPTIMAL)
-
Polynomial Optimization, Efficiency through Moments and Algebra (POEMA)
-
Towards a Quantitative Theory of Integer Programming (QIP)
Related partners
-
Alma Mater Studiorum-Universita di Bologna
-
Alpen-Adria-Universität Klagenfurt
-
CNR Pisa
-
CNRS
-
Dassault Systèmes B.V.
-
IBM
-
INRIA
-
Rheinische Friedrich-Wilhelmus Universitaet Bonn
-
Technische Universität Dortmund
-
Tilburg University
-
Tromsø, Norway
-
Universita degli Studi di Firenze
-
Universität Konstanz
-
University of Birmingham
-
Universiteit van Tilburg