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.

 

Video about our collaboration with ProRail (in Dutch)

 

READ MORE...

Vacancies

News

CWI and ProRail predict railway incidents

CWI and ProRail predict railway incidents

Centrum Wiskunde & Informatica and ProRail recently started a research collaboration in the area of the handling of incidents at the Dutch railways. It concerns a public private partnership between CWI and ProRail striking up a four year period. The research is aimed at prevention and handling of a broad spectrum of railway incidents, like disturbance of the railway infrastructure, people walking on the tracks and collisions.

CWI and ProRail predict railway incidents - Read More…

Current events

Dutch Seminar on Optimization (online series) with Lucas Slot (CWI) and Juan José Maulén (Groningen)

  • 2021-10-28T16:00:00+02:00
  • 2021-10-28T17:00:00+02:00
October 28 Thursday

Start: 2021-10-28 16:00:00+02:00 End: 2021-10-28 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. 

Speakers:  Lucas Slot (CWI) and Juan José Maulén (RU Groningen)

Title of the talk of Lucas Slot: Degree bounds for positivity certificates and the polynomial kernel method
Abstract of the talk of Lucas Slot:
The classical Positvestellensaetze of Putinar and Schmuedgen state that the positivity of a polynomial f over a (compact) semialgebraic set S can be verified by expanding f as a conic combination of the polynomials that define S, using sums of squares of polynomials as coefficients. Recently, there has been an interest in proving bounds on the largest degree of the sum-of-squares coefficients involved in this expansion. Such bounds have direct implications for the convergence rate of Lasserre-type hierarchies for polynomial optimization. We present the polynomial kernel method for proving degree bounds on special sets S, which was first used in the case of the hypersphere by Fang and Fawzi.
We apply the PKM to additional sets, including the binary hypercube {-1, 1}^n, the unit box [-1, 1]^n and the unit ball.

This is based on joint work with Monique Laurent.
Arxiv link: https://arxiv.org/abs/2011.04027

Title of the talk of Juan José Maulén: Acceleration of fixed point algorithms via inertia
Abstract of the talk of Juan José Maulén:
In this talk, we will use the results about the convergence of inertial optimization algorithms, defined as fixed point iterations from a family of cocoercive operators. This result implies that exists inertial versions of the Primal-dual splitting algorithm proposed by Briceño and Roldan on 2019, and for the three-operator splitting scheme proposed by Davis and Yin on 2015. Both algorithms fit on the framework of optimization algorithms defined by cocoercive operators. The inertial versions obtained are tested in several numerical experiments, where  better performance with respect to the original algorithms can be observed.

 

The lecture will be given online. Please visit the website for more information and the zoom link. 

Members

Associated Members

Publications

Current projects with external funding

  • Smart Heuristic Problem Optimization ()
  • Wiskundecluster DIAMANT ()
  • Mixed-Integer Non-Linear Optimisation Applications (MINOA)
  • Optimization for and with Machine Learning (OPTIMAL)
  • Polynomial Optimization, Efficiency through Moments and Algebra (POEMA)
  • Vóórkomen en voorkómen van incidenten op het spoor (PPS Prorail)
  • 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
  • Prorail
  • 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