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.

 

 

 

READ MORE...

Vacancies

News

Current events

N&O seminar: Jeannette Janssen (Dalhousie University)

  • 2019-01-09T11:00:00+01:00
  • 2019-01-09T12:00:00+01:00
January 9 Wednesday

Start: 2019-01-09 11:00:00+01:00 End: 2019-01-09 12:00:00+01:00

CWI, Lecture room L016

We would like to announce the following lecture of Jeannette Janssen at the N&O seminar:

Title: Recognizing graphs formed by a spatial random process

It is a safe assumption about social networks that links are more often formed between people that have a lot in common. This can be modelled with a simple spatial model for link formation. Individuals are represented by vertices placed in a virtual space that represents their interests and characteristics. Links are formed stochastically, with links becoming less likely when vertices are further apart. Is this spatial model accurate? More specifically, given only the link structure, can we measure to what extent the graph conforms to such a spatial model? This question can be addressed by using the theory of graph limits. I will show how graph limit theory can be used to recognize graphs that have a clear linear (one-dimensional) structure. This is joint work with Mahya Ghandehari and Aaron Smith.

Early bird registration NMC 2019: deadline 31 December 2019

  • 2019-04-23T09:00:00+02:00
  • 2019-04-24T18:00:00+02:00
April 23 Tuesday

Start: 2019-04-23 09:00:00+02:00 End: 2019-04-24 18:00:00+02:00

Congress Centre Koningshof, Veldhoven

On April 23-24, 2019, the Dutch Mathematical Congress (NMC 2019) will be held in the Congress Centre Koningshof  (located in Veldhoven, close to Eindhoven).
  
Given the success of the first "NMC new style" earlier this year, we hope that in 2019 there will be even more participants. Once again we have compiled a very attractive programme with the following ingredients:
Plenary lectures by Barbara Gentz, Jan Hesthaven, Gábor Lugosi and Anke van Zuylen
Parallel sessions by the Gravitation programmes Networks and Quantum Software Consortium, and of pairs of clusters inspired by the new topics in the “Sectorplan”
A strategy session on the cluster evaluation and the “Sectorplan”
Speed dates with industry
Poster prize, KWG prize for PhD students, the Stieltjes prize and the new “innovation” prize for MSc students
Social programme with dinner and dance performance based on the ‘spurs of Lehmer’

The "early bird" registration period, giving you a discount of € 50,-,  ends December 31st, so register now!  
 
You can find more information and a link to the registration form.
 
With regards,
On behalf of the organising committee,
  
Evgeny Verbitsky (chair)

Members

Associated Members

Publications

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