Program PhD Presentations Soesterberg 2024

A pdf-file of the schedule of the PhD presentations can be found here.

PhD presentations

 

Monday (14.25 – 16.05)

Room: Steyl

14:25 - 14:50        Sophie Klumper (CWI)

                          To Trust, or Not to Trust: Truthful Mechanisms for Maximum Weighted Matching Problems in Private Bipartite Graphs with Predictions

                          Discussant: Tim Oosterwijk

14:50 - 15:15        Fabio Mercurio (TU/e)

                          Cooperative Locker Location Games

                          Discussant: André Berger

15:15 - 15:40        Arman Rouhani (Maastricht University)

                          An improved bound for the price of anarchy for related machine scheduling

                          Discussant: Pieter Kleer

15:40 - 16:05        Kim van den Houten (TU Delft)

                          Learning from scenarios in the context of stochastic scheduling

                          Discussant: Leen Stougie

 

Room: Congo

14:25 - 14:50        Laura Sprenkels (TU/e)

                          The good stuff: Matching supply and demand by introducing an opaque product: Pricing, learning, fun.

                          Discussant: Janusz Meylahn

14:50 - 15:15        Joris Slootweg (CWI)

                           Improving Congestion in an Efficient & Robust manner using smart Virtual Queuing at Airport Security

                          Discussant: Willem van Jaarsveld

15:15 - 15:40        Hayo Bos (University of Twente)

                          Predicting next week’s bed census: combining medical expertise with data.

                          Discussant: Caroline Jagtenberg

15:40 - 16:05        Robin Buter (University of Twente)

                          Strategic placement of defibrillators

                          Discussant: Theresia van Essen

 

Room: China

14:25 - 14:50        Mathijs Barkel (Tilburg University)

                          Bounding Procedures and Exact Arcflow Formulations for the Bin Packing Problem with Minimum Color Fragmentation

                          Discussant: Paul Bouman

14:50 - 15:15        Ashkan Safari (Maastricht University)

                          A k-swap Local Search for Makespan Scheduling

                          Discussant: Antonios Antoniadis

15:15 - 15:40        Jesse van Rhijn (University of Twente)

                          Some new Results on Hartigan's Method for k-Means Clustering

                          Discussant: René Sitters

15:40 - 16:05        Judith Brugman (Tilburg University)

                          Large-scale Appointment Scheduling via Robust Convex Optimization with Polyhedral Uncertainty Sets

                          Discussant: Ahmadreza Marandi

 

Tuesday (14.25 – 16.05)

 

Room: Steyl

14:00 - 14:25        Niels Wouda (University of Groningen)

                          Optimising Groningen's waste collection

                          Discussant: Frits Spieksma

14:25 - 14:50        Pedro José Correia Duarte (Erasmus University)

                          A Cyclic Timetabling Approach to Determine Optimal ERTMS Rollout

                          Discussant: Marjan van den Akker

14:50 - 15:15        Renate van der Knaap (TU Delft)

                          Railway line planning for varying demand with focus on stop planning, frequency setting, and asymmetric lines

                          Discussant: Rolf van Lieshout

15:15 - 15:40        Linda Punt (Erasmus University)

                          Integrating EV Fleet Flexibility into Robust Optimal Planning of Local Power Grids

                          Discussant: Johann Hurink

15:40 - 16:05        Leoni Winschermann (University of Twente)

                          Relating Electric Vehicle Charging to Speed Scaling with Job-Specific Speed Limits

                          Discussant: Remy Spliet

 

Room: Congo

14:00 - 14:25        Lucas Vogels (UvA)

                          Bayesian Structure Learning in Undirected Gaussian Graphical Models

                          Discussant: Bernd Heidergott

14:25 - 14:50        Wessel Blomerus (TU/e)

                          Structured learning of the optimal replacement rule beyond Markov settings

                          Discussant: Odysseas Kanavetas

14:50 - 15:15        Nanne A. Dieleman (VU)

                          A Pseudo-Gradient Approach for Model-free Markov Chain Optimization

                          Discussant: Ilker Birbil

15:15 - 15:40        Tim Engels (TU/e)

                          Batch sojourn times in polling systems on a circle

                          Discussant: Werner Scheinhardt

15:40 - 16:05        Purva Joshi (TU/e)

                          Efficiently Navigating Autonomous Vehicles through Intersections

                          Discussant: René Haijema

 

Room: China

14:00 - 14:25        Lotte Weedage (University of Twente)

                          Edge recovery in geometric random graphs

                          Discussant: Aida Abiad

14:25 - 14:50        Sten Wessel (TU/e)

                          Fairness in Graph-Theoretical Optimization Problems

                          Discussant: Ruben Hoeksma

14:50 - 15:15        Rolf van der Hulst (University of Twente)

                          A row augmentation algorithm for graph realization

                          Discussant: Christopher Hojny

15:15 - 15:40        Jelle Oostveen (Utrecht University)

                          The Parameterised Complexity of Integer Multicommodity Flow

                          Discussant: Lars Rohwedder

15:40 - 16:05        Hadi Abbaszadehpeivasti (Tilburg University)

                          On the convergence rate of the difference-of-convex algorithm (DCA)

                          Discussant: Dick den Hertog