Pages that link to "Item:Q2116930"
From MaRDI portal
The following pages link to An assign-and-route matheuristic for the time-dependent inventory routing problem (Q2116930):
Displaying 4 items.
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
- A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows (Q6109341) (← links)
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand (Q6551134) (← links)
