Marlin W. Ulmer
Orcid: 0000-0003-2499-6570Affiliations:
- University of Magdeburg, Germany
- TU Braunschweig, Germany (former)
According to our database1,
Marlin W. Ulmer
authored at least 48 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
OR Spectr., June, 2024
OR Spectr., June, 2024
Transp. Sci., 2024
Adaptive stochastic lookahead policies for dynamic multi-period purchasing and inventory routing.
Eur. J. Oper. Res., 2024
Learning State-Dependent Policy Parametrizations for Dynamic Technician Routing with Rework.
CoRR, 2024
Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions.
Comput. Oper. Res., 2024
2023
Robotized sorting systems: Large-scale scheduling under real-time conditions with limited lookahead.
Eur. J. Oper. Res., October, 2023
Dynamic priority rules for combining on-demand passenger transportation and transportation of goods.
Eur. J. Oper. Res., August, 2023
Combining value function approximation and multiple scenario approach for the effective management of ride-hailing services.
EURO J. Transp. Logist., 2023
Comput. Oper. Res., 2023
2022
Transp. Sci., 2022
Transp. Sci., 2022
Networks, 2022
Eur. J. Oper. Res., 2022
Eur. J. Oper. Res., 2022
4OR, 2022
Decision Support for Agri-Food Supply Chains in the E-Commerce Era: The Inbound Inventory Routing Problem with Perishable Products.
Proceedings of the Metaheuristics - 14th International Conference, 2022
2021
The Restaurant Meal Delivery Problem: Dynamic Pickup and Delivery with Deadlines and Random Ready Times.
Transp. Sci., 2021
Where the Action is: Let's make Reinforcement Learning for Stochastic Dynamic Vehicle Routing Problems work!
CoRR, 2021
2020
Building Trust in Home Services - Stochastic Team-Orienteering with Consistency Constraints.
Transp. Sci., 2020
Meso-parametric value function approximation for dynamic customer acceptances in delivery routing.
Eur. J. Oper. Res., 2020
EURO J. Transp. Logist., 2020
Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing.
Central Eur. J. Oper. Res., 2020
2019
Enough Waiting for the Cable Guy - Estimating Arrival Times for Service Vehicle Routing.
Transp. Sci., 2019
Offline-Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests.
Transp. Sci., 2019
Anticipation versus reactive reoptimization for dynamic vehicle routing with stochastic requests.
Networks, 2019
EURO J. Transp. Logist., 2019
Deep Q-Learning for Same-Day Delivery with a Heterogeneous Fleet of Vehicles and Drones.
CoRR, 2019
Comput. Oper. Res., 2019
Dynamic Lookahead Policies for Stochastic-Dynamic Inventory Routing in Bike Sharing Systems.
Comput. Oper. Res., 2019
Bus. Inf. Syst. Eng., 2019
2018
Transp. Sci., 2018
Eur. J. Oper. Res., 2018
2017
On the Value and Challenge of Real-Time Information in Dynamic Dispatching of Service Vehicles.
Bus. Inf. Syst. Eng., 2017
Proceedings of the Operations Research Proceedings 2017, 2017
2016
Problem-Specific State Space Partitioning for Dynamic Vehicle Routing Problems.
Proceedings of the Multikonferenz Wirtschaftsinformatik, 2016
Proceedings of the Learning and Intelligent Optimization - 10th International Conference, 2016