55 citations · 136 across the 10 of their papers we have counts for
11 papers
You Shall Pass: Dealing with the Zero-Gradient Problem in Predict and Optimize for Convex Optimization
Grigorii Veviurko, Wendelin Böhmer, Mathijs de Weerdt
Predict and optimize is an increasingly popular decision-making paradigm that employs machine learning to predict unknown parameters of optimization problems. Instead of minimizing…
ReproducedPapers.org: Openly teaching and structuring machine learning reproducibility
Burak Yildiz, Hayley Hung, Jesse H. Krijthe +9
We present ReproducedPapers.org: an open online repository for teaching and structuring machine learning reproducibility. We evaluate doing a reproduction project among students an…
Continuous surrogate-based optimization algorithms are well-suited for expensive discrete problems
Rickard Karlsson, Laurens Bliek, Sicco Verwer +1
One method to solve expensive black-box optimization problems is to use a surrogate model that approximates the objective based on previous observed evaluations. The surrogate, whi…
Train Unit Shunting and Servicing: a Real-Life Application of Multi-Agent Path Finding
Jesse Mulderij, Bob Huisman, Denise Tönissen +2
In between transportation services, trains are parked and maintained at shunting yards. The conflict-free routing of trains to and on these yards and the scheduling of service and…
Black-box Combinatorial Optimization using Models with Integer-valued Minima
Laurens Bliek, Sicco Verwer, Mathijs de Weerdt
When a black-box optimization objective can only be evaluated with costly or noisy measurements, most standard optimization algorithms are unsuited to find the optimal solution. Sp…
Order Acceptance and Scheduling with Sequence-dependent Setup Times: a New Memetic Algorithm and Benchmark of the State of the Art
Lei He, Arthur Guijt, Mathijs de Weerdt +2
The Order Acceptance and Scheduling (OAS) problem describes a class of real-world problems such as in smart manufacturing and satellite scheduling. This problem consists of simulta…
Complexity of Scheduling Charging in the Smart Grid
Mathijs de Weerdt, Michael Albert, Vincent Conitzer
In the smart grid, the intent is to use flexibility in demand, both to balance demand and supply as well as to resolve potential congestion. A first prominent example of such flexi…
Towards Decision Support in Reciprocation
Gleb Polevoy, Mathijs de Weerdt, Catholijn Jonker
People often interact repeatedly: with relatives, through file sharing, in politics, etc. Many such interactions are reciprocal: reacting to the actions of the other. In order to f…
Solving Transition-Independent Multi-agent MDPs with Sparse Interactions (Extended version)
Joris Scharpff, Diederik M. Roijers, Frans A. Oliehoek +2
In cooperative multi-agent sequential decision making under uncertainty, agents must coordinate to find an optimal joint policy that maximises joint value. Typical algorithms explo…
Scheduling with two non-unit task lengths is NP-complete
Jan Elffers, Mathijs de Weerdt
The non-preemptive job scheduling problem with release times and deadlines on a single machine is fundamental to many scheduling problems. We parameterize this problem by the set o…
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
Léon R. Planken, Mathijs M. de Weerdt, Roman P. J. van der Krogt
We present two new and efficient algorithms for computing all-pairs shortest paths. The algorithms operate on directed graphs with real (possibly negative) weights. They make use o…