Fabian Akkerman

Orcid: 0000-0001-8055-9864

According to our database1, Fabian Akkerman authored at least 12 papers between 2020 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
PACE: Prune-And-Compress Ensemble Models.
CoRR, May, 2026

Breaking the Grid: Distance-Guided Reinforcement Learning in Large Discrete and Hybrid Action Spaces.
CoRR, February, 2026

2025
Distance approximation to support customer selection in vehicle routing problems.
Ann. Oper. Res., July, 2025

Learning Dynamic Selection and Pricing of Out-of-Home Deliveries.
Transp. Sci., 2025

Boosting Revisited: Benchmarking and Advancing LP-Based Ensemble Methods.
Trans. Mach. Learn. Res., 2025

Dynamic reordering and inspection for the multi-item Inventory Record Inaccuracy problem.
Eur. J. Oper. Res., 2025

A comparison of reinforcement learning policies for dynamic vehicle routing problems with stochastic customer requests.
Comput. Ind. Eng., 2025

2024
Solving Dual Sourcing Problems with Supply Mode Dependent Failure Rates.
CoRR, 2024

Dynamic Neighborhood Construction for Structured Large Discrete Action Spaces.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Handling Large Discrete Action Spaces via Dynamic Neighborhood Construction.
CoRR, 2023

2022
Dynamic Time Slot Pricing Using Delivery Costs Approximations.
Proceedings of the Computational Logistics - 13th International Conference, 2022

2020
Distance Approximation for Dynamic Waste Collection Planning.
Proceedings of the Computational Logistics - 11th International Conference, 2020


  Loading...