Distance Approximation for Dynamic Waste Collection Planning. - Fabian Akkerman; Martijn Mes; Wouter Heijnen (ICCL, 2020)

Dynamic Time Slot Pricing Using Delivery Costs Approximations. - Fabian Akkerman; Martijn Mes; Eduardo Lalla-Ruiz (ICCL, 2022)

Handling Large Discrete Action Spaces via Dynamic Neighborhood Construction. - Fabian Akkerman; Julius Luy; Wouter van Heeswijk; Maximilian Schiffer (CoRR, 2023)

Dynamic Neighborhood Construction for Structured Large Discrete Action Spaces. - Fabian Akkerman; Julius Luy; Wouter van Heeswijk; Maximilian Schiffer (ICLR, 2024)

Solving Dual Sourcing Problems with Supply Mode Dependent Failure Rates. - Fabian Akkerman; Nils Knofius; Matthieu van der Heijden; Martijn Mes (CoRR, 2024)

A comparison of reinforcement learning policies for dynamic vehicle routing problems with stochastic customer requests. - Fabian Akkerman; Martijn Mes; Willem van Jaarsveld (Comput. Ind. Eng., 2025)

Dynamic reordering and inspection for the multi-item Inventory Record Inaccuracy problem. - Fabian Akkerman; Dennis Prak; Martijn Mes (Eur. J. Oper. Res., 2025)

Learning Dynamic Selection and Pricing of Out-of-Home Deliveries. - Fabian Akkerman; Peter Dieter; Martijn Mes (Transp. Sci., 2025)

Distance approximation to support customer selection in vehicle routing problems. - Fabian Akkerman; Martijn Mes (Ann. Oper. Res., 2025)

Boosting Revisited: Benchmarking and Advancing LP-Based Ensemble Methods. - Fabian Akkerman; Julien Ferry; Christian Artigues; Emmanuel Hebrard; Thibaut Vidal (CoRR, 2025)