Description
Leader of the group Networks and Optimization: Guido Schäfer.
By combining techniques from mathematics and computer science, we develop algorithmic methods to tackle complex optimization problems. Our research provides efficient solutions to some of the world’s most challenging problems, for example in planning, scheduling and routing.
Vacancies
Postdoc in the research project "Approximation Algorithms, Quantum Information and Semidefinite Optimization"
The research project “Approximation algorithms, quantum information and semidefinite optimization” aims to explore the limits of efficient computation within classical and quantum computing, using semidefinite optimization as a main unifying tool. The position involves research into the mathematical and computer science aspects of approximation algorithms for discrete optimization, quantum entanglement in communication, and complexity of fundamental problems in classical and quantum computing. More information about the project can be found at this website.
News
Neil Olver receives Veni grant for network research
The Dutch Organization for Scientific Research (NWO) has awarded Neil Olver a Veni grant for his project 'Designing better, faster networks'. Olver, who is currently affiliated with the Mathematics department of MIT, will carry out his research at the Operations Research group at VU University Amsterdam and the Networks and Optimization group at Centrum Wiskunde & Informatica.
CWI Lectures organized in honour of Lex Schrijver
To honour mathematician and Spinoza Award winner Lex Schrijver, Centrum Wiskunde & Informatica (CWI) organized the CWI Lectures 2013 – the 'CWI Lexures' – on Thursday 25 April in Amsterdam.
Lex Schrijver elected AMS Fellow
The American Mathematical Society (AMS) chose its first AMS Fellows, and among them is Lex Schrijver from the Centrum Wiskunde & Informatica (CWI) and the University of Amsterdam. Other Dutch members of the 2013 inaugural class are Frank den Hollander (Leiden University and CWI Governing Board), Robbert Dijkgraaf (Institute of Advanced Study and UvA), Jacob Korevaar (em.
Lex Schrijver speaker at Nemo Wakker Worden Kinderlezing
On 13 Januari 2013 CWI researcher Lex Schrijver spoke at the Nemo Wakker Worden Kinderlezing 'What is the shortest way home?' (Wat is de kortste weg naar huis?) on optimal combinations in daily life. Read Nemo's report here (in Dutch).
Members of Networks and Optimization
Publications
-
Laurent, M, & Seminaroti, M. (2017). Similarity-First Search: A new algorithm with application to Robinsonian matrix recognition. SIAM Journal on Discrete Mathematics, 31(3), 1765–1800. doi:https://doi.org/10.1137/16M1056791
-
Gribling, S.J, de Laat, D, & Laurent, M. (2017). Lower bounds on matrix factorization ranks via noncommutative polynomial optimization.
-
de Klerk, E, Lasserre, J.B, Laurent, M, & Sun, Z. (2017). Bound-constrained polynomial optimization using only elementary calculations. Mathematics of Operations Research, 42(3), 834–853. doi:10.1287/moor.2016.0829
-
Apt, K.R, de Keijzer, B, Rahn, M.M, Schäfer, G, & Simon, S.E. (2017). Coordination games on graphs. International Journal of Game Theory. doi:10.1007/s00182-016-0560-8
-
Kleer, P.S, & Schäfer, G. (2017). Potential function minimizers of combinatorial congestion games: Efficiency and computation. In EC 2017 - Proceedings of the 2017 ACM Conference on Economics and Computation (pp. 223–240). doi:10.1145/3033274.3085149
-
Laurent, M, & Tanigawa, S.-I. (2017). Perfect elimination orderings for symmetric matrices.
-
de Klerk, E, & Laurent, M. (2017). Comparison of Lasserre's measure-based bounds for polynomial optimization to bounds obtained by simulated annealing.
-
de Klerk, E, Laurent, M, Sun, Z, & Vera, J.C. (2017). On the convergence rate of grid search for polynomial optimization over the simplex. Optimization Letters, 11(3), 597–608. doi:10.1007/s11590-016-1023-7
-
de Klerk, E, Laurent, M, & Sun, Z. (2017). Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization. Mathematical Programming, 162(1), 363–392. doi:10.1007/s10107-016-1043-1
-
Gribling, S.J, de Laat, D, & Laurent, M. (2017). Matrices with high completely positive semidefinite rank. Linear Algebra and Its Applications, 513, 122–148. doi:10.1016/j.laa.2016.10.015
Current projects with external funding
-
New Frontiers in Lattice Algorithms and Design
-
Verbeteren van de efficiency en prestatie van logistieke processen in de binnevaart
-
Wiskundecluster DIAMANT / Tenure Track positie Daniel Dadush
-
AQSOApproximation Algorithms, Quantum Information and Semidefinite Optimization
-
CoMGACombining Machine Learning and Game-theoretic Approaches for Cluster Analysis
-
ITSLOGReal Time Verkeersdata voor Goederenvervoer (ITSLOG)
-
MINOAMixed-Integer Non-Linear Optimisation Applications
-
NetworksNetworks (eerste fase)
-
SocialACTSocietal Impact Games
Related partners
-
CTVrede
-
Stanford University
-
Radboud Universiteit
-
Technische Universiteit Eindhoven
-
Universiteit Leiden
-
Universiteit van Amsterdam
-
Universiteit van Amsterdam