Pages that link to "Item:Q5119412"
From MaRDI portal
The following pages link to Dynamic Matching for Real-Time Ride Sharing (Q5119412):
Displaying 14 items.
- Optimizing large on-demand transportation systems through stochastic conic programming (Q2239886) (← links)
- Matching While Learning (Q4994180) (← links)
- Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem (Q4995102) (← links)
- Asymptotically Optimal Allocation Policies for Transplant Queueing Systems (Q4997147) (← links)
- A stochastic matching model on hypergraphs (Q5013243) (← links)
- On the Optimal Design of a Bipartite Matching Queueing System (Q5031017) (← links)
- Spatial Capacity Planning (Q5080677) (← links)
- Optimal Control of a Time-Varying Double-Ended Production Queueing Model (Q5084486) (← links)
- Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework (Q5095174) (← links)
- Dynamic Stochastic Matching Under Limited Time (Q5106373) (← links)
- A new <scp>ride‐sharing</scp> model incorporating the passengers' efforts (Q6076477) (← links)
- Platform exploitation in the sharing economy (Q6161281) (← links)
- Applications of fluid models in service operations management (Q6163558) (← links)
- Matched queues with flexible and impatient customers (Q6164830) (← links)
