Pages that link to "Item:Q1991276"
From MaRDI portal
The following pages link to An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy (Q1991276):
Displayed 11 items.
- Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands (Q2183324) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
- Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand (Q2676279) (← links)
- Resilient route design for collection of material from suppliers with split deliveries and stochastic demands (Q2676305) (← links)
- A vehicle routing problem with multiple service agreements (Q6066197) (← links)
- Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut (Q6106761) (← links)
- Optimizing integrated aircraft assignment and turnaround handling (Q6113450) (← links)
- The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands (Q6161273) (← links)
- An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup (Q6164581) (← links)
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands (Q6167539) (← links)
