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, realworld 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 problemspecific 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 realworld problems. We are always interested in new algorithmic challenges arising in realworld 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
Current events
N&O seminar: Kevin Shu (Georgia Tech)
 20220928T16:00:00+02:00
 20220928T17:00:00+02:00
N&O seminar: Kevin Shu (Georgia Tech)
Start: 20220928 16:00:00+02:00 End: 20220928 17:00:00+02:00
Everyone is welcome to attend the next N&O seminar with Kevin Shu with the title 'Sparse Quadratic Programs via Polynomial Roots'.
The talk will take place online and we will watch it together in L017. For more information and registration to get the Zoom link via email, please contact Willem Feijen (willem.feijen at cwi.nl), Samarth Tiwari (samarth.tiwari at cwi.nl) or Sven Polak (sven.polak at cwi.nl).
Abstract: We'll talk about problems of optimizing a quadratic function subject to quadratic constraints, in addition to a sparsity constraint that requires that solutions have only a few nonzero entries. Such problems include sparse versions of linear regression and principal components analysis. We'll see that this problem can be formulated as a convex conical optimization problem over a sparse version of the positive semidefinite cone, and then see how we can approximate such problems using ideas arising from the study of hyperbolic polynomials. We'll also describe a fast algorithm for such problems, which performs well in practical situations.
If you would like to link to a paper, here is one: https://arxiv.org/abs/2208.11143
Dutch Seminar on Optimization (online series) with Jesse van Rijn (Twente) and Sander Borst (CWI)
 20220929T16:00:00+02:00
 20220929T17:00:00+02:00
Dutch Seminar on Optimization (online series) with Jesse van Rijn (Twente) and Sander Borst (CWI)
Start: 20220929 16:00:00+02:00 End: 20220929 17:00:00+02:00
The Dutch Seminar on Optimization is an initiative to bring together researchers from the Netherlands and beyond, with topics that are centered around Optimization in a broad sense. We would like to invite all researchers, especially also PhD students, who are working on related topics to join the events. We hereby announce the following two talks, given by PhDstudents:
Speaker: Jesse van Rijn (Twente)
Title: Towards a Lower Bound for the Average Case Runtime of Simulated Annealing on TSP
Date: Thursday 29 September, 4pm4:30pm
Abstract:
We analyze simulated annealing (SA) for simple randomized instances of the Traveling Salesperson Problem. Our analysis shows that the theoretically optimal cooling schedule of Hajek explores members of the solution set which are in expectation far from the global optimum. We obtain a lower bound on the expected length of the final tour obtained by SA on these random instances. In addition, we also obtain an upper bound on the expected value of its variance. These bounds assume that the Markov chain that describes SA is stationary, a situation that does not truly hold in practice. Hence, we also formulate conditions under which the bounds extend to the nonstationary case. These bounds are obtained by comparing the tour length distribution to a related distribution. We furthermore provide numerical evidence for a stochastic dominance relation that appears to exist between these two distributions, and formulate a conjecture in this direction. If proved, this conjecture implies that SA stays far from the global optimum with high probability when executed for any subexponential number of iterations. This would show that SA requires at least exponentially many iterations to reach a global optimum with nonvanishing probability.
Speaker: Sander Borst (CWI)
Title: Selection in explorable heaps
Date: Thursday 29 September, 4:30pm5pm
Abstract:
Explorable heap selection is the problem of selecting the nth smallest value in a binary heap, where the values can only be accessed by traversing the binary tree. In this setting we want to minimize the distance traveled in the tree. The problem is related to the node selection problem for the branchandbound algorithm.
The problem was originally proposed by Karp, Saks and Widgerson (FOCS '86), who also proposed algorithms for this problem. Recently we found a new algorithm, that improves on the running time. In this talk I will explain the problem, our new algorithm and the connection between the problem and branchandbound.
PhD Defence Lucas Slot (N&O)
 20220930T10:00:00+02:00
 20220930T11:30:00+02:00
PhD Defence Lucas Slot (N&O)
Start: 20220930 10:00:00+02:00 End: 20220930 11:30:00+02:00
Everyone is welcome to attend the public defense of Lucas Slot, of his thesis ' Asymptotic Analysis of Semidefinite Bounds for Polynomial Optimization and Independent Sets in Geometric Hypergraphs' .
Promotor : Prof. Monique Laurent (CWI, Tilburg University)
Copromotor : Prof. Etienne de Klerk (Tilburg University)
Workshop on Solving Polynomial Equations and Applications (Semester Programme)
 20221005T00:00:00+02:00
 20221007T23:59:59+02:00
Workshop on Solving Polynomial Equations and Applications (Semester Programme)
Start: 20221005 00:00:00+02:00 End: 20221007 23:59:59+02:00
Polynomial equations are at the heart of many problems in pure and applied mathematics. They form a powerful tool for modelling nonlinear phenomena in the sciences. Application areas range from robotics, chemistry and computer vision to quantum physics and statistics. Recent progress has made it possible to reliably solve challenging polynomial equations arising in such practical contexts. This workshop will feature a friendly introduction to existing methods, presentations of the latest software tools and research talks by experts in the field. The focus will be on new trends and methodology, as well as applications in the sciences.
This workshop is coorganized by Monique Laurent and Simon Telen.
Here you can find more information on the program of CWI's Solving Polynomial Equations and Applications workshop.
Please register here.
CWI Lectures on Algebraic and Geometric Methods in Optimization (2022)
 20221116T13:00:00+01:00
 20221116T18:00:00+01:00
CWI Lectures on Algebraic and Geometric Methods in Optimization (2022)
Start: 20221116 13:00:00+01:00 End: 20221116 18:00:00+01:00
How to compose a portfolio ensuring maximum revenue while minimizing risk? How to control trajectories of solutions in dynamical systems? How to find the best sphere packing or the minimum energy of an interacting particle system? How to find optimal power flows in energy networks?
Such difficult optimization problems arise in diverse fields and application areas, such as operations research, discrete geometry, machine learning, theoretical computer science, and control theory.
These CWI Lectures are devoted to novel solution methods that combine dedicated algebraic and geometric approaches and sophisticated computational tools from mathematics and computer science.
Various aspects will be covered by four worldleading experts: Amir Ali Ahmadi (Princeton University), Etienne de Klerk (Tilburg University), Rekha Thomas (University of Washington), and Frank Vallentin (Universität zu Köln).
During the event, we will celebrate Monique Laurent’s appointment as a CWI Fellow for her contributions to research in the area of Semidefinite and Polynomial Optimization. The theme of this year’s lectures was chosen in honor of Monique’s work.
The lectures are intended for a broad mathematical audience and in 2022 the program committee consists of Daniel Dadush and Guido Schäfer (Networks and Optimization Group). This event at CWI is freely accessible after registration.
Preliminary program:
13.00–13.10 Welcome
13.10–13.55 Etienne de Klerk (Tilburg University)  Proving inequalities using semidefinite programming duality: applications in the worstcase analysis of iterative methods
13.55–14.40 Frank Vallentin (Universität zu Köln)  Generalizations and Applications of the Lovász theta number
14.40–15.15 Break
15.15–16.00 Amir Ali Ahmadi (Princeton University)  Local Minima in Polynomial Optimization
16.00–16.45 Rekha Thomas (University of Washington)  Graphical Designs: Structure, Complexity and Applications
16.45–16.50 Closing
16.50–18.00 Drinks
On this page, you'll find more information about the speakers and their presentations.
For inquiries and further details about the lectures, please contact event coordinator Daniëlle Kollerie (D.C.Kollerie@cwi.nl).
Workshop on Polynomial Optimization and Applications in Control and Energy (Semester Programme)
 20221117T00:00:00+01:00
 20221118T23:59:59+01:00
Workshop on Polynomial Optimization and Applications in Control and Energy (Semester Programme)
Start: 20221117 00:00:00+01:00 End: 20221118 23:59:59+01:00
This workshop is devoted to the application of polynomial optimization methods in the analysis and control of dynamical systems and energy networks. The polynomial optimization approach offers a powerful framework to model hard nonconvex, nonlinear control problems as infinite dimensional linear optimization problems over measure spaces. The rich interplay between functional analysis and operator theory, and real algebraic geometry, underlies the nowadays wellknown moment/sumofsquares hierarchy of relaxations, that allows to efficiently obtain converging sequences of bounds. This approach has also been recently developed to attack large optimal power flow problems in large electrical networks. The program (under construction) will feature lectures by experts in the field and ample time will be left for discussions.
This workshop is coorganized by Monique Laurent and Bert Zwart.
Here you can find more information on the program of CWI's Polynomial Optimization and Applications in Control and Energy workshop.
Please register here.
Members
Associated Members
Publications

Slot, L.F.H. (2022, September 30). Asymptotic analysis of semidefinite bounds for polynomial optimization and independent sets in geometric hypergraphs. Center dissertation series. Retrieved from http://dx.doi.org/10.26116/wsbskt84

Brokkelkamp, K.R. (2022, September 21). How close does it get? From nearoptimal network algorithms to suboptimal equilibrium outcomes. ILLC Dissertation Series.

Gribling, S.J, Laurent, M, & Steenkamp, J.A.J. (2022). Bounding the separable rank via polynomial optimization. Linear Algebra and its Applications, 648, 1–55. doi:10.1016/j.laa.2022.04.010

Bansal, N, Sinha, M, & de Wolf, R.M. (2022). Influence in completely bounded blockmultilinear forms and classical simulation of quantum algorithms. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.CCC.2022.28

Huizing, D, van der Mei, R.D, Schäfer, G, & Bhulai, S. (2022). The enriched median routing problem and its usefulness in practice. Computers and Industrial Engineering, 168, 108063.1–108063.14. doi:10.1016/j.cie.2022.108063

Bonnet, G.F.Y, Dadush, D.N, Grupel, U, Huiberts, S, & Livshyts, G. (2022). Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes. In Leibniz International Proceedings in Informatics (pp. 18:1–18:15). doi:10.4230/LIPIcs.SoCG.2022.18

Huiberts, S. (2022, May 16). Geometric aspects of linear programming : shadow paths, central paths, and a cutting plane method.

Polak, S.C. (2022). Symmetry reduction to optimize a graphbased polynomial from queueing theory. SIAM Journal on Applied Algebra and Geometry, 6(2), 243–266. doi:10.1137/21M1413298

Birmpas, G, Markakis, V, & Schäfer, G. (2022). Cost sharing over combinatorial domains. ACM Transactions on Economics and Computation, 10(1), 4.1–4.26. doi:10.1145/3505586

Amanatidis, G, Kleer, P.S, & Schäfer, G. (2022). Budgetfeasible mechanism design for nonmonotone submodular objectives: Offline and online. Mathematics of Operations Research. doi:10.1287/moor.2021.1208
Current projects with external funding

Smart Heuristic Problem Optimization ()

MixedInteger NonLinear 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 StudiorumUniversita di Bologna

AlpenAdriaUniversität Klagenfurt

CNR Pisa

CNRS

Dassault Systèmes B.V.

IBM

INRIA

Rheinische FriedrichWilhelmus Universitaet Bonn

Technische Universität Dortmund

Tilburg University

Tromsø, Norway

Universita degli Studi di Firenze

Universität Konstanz

University of Birmingham

Universiteit van Tilburg