Pages that link to "Item:Q5003707"
From MaRDI portal
The following pages link to Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707):
Displaying 9 items.
- Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty (Q5046625) (← links)
- Approximating the chance-constrained capacitated vehicle routing problem with robust optimization (Q6054019) (← links)
- Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut (Q6106761) (← links)
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands (Q6167539) (← links)
- Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty (Q6633275) (← links)
- Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques (Q6659088) (← links)
