Pages that link to "Item:Q2398107"
From MaRDI portal
The following pages link to Improved branch-cut-and-price for capacitated vehicle routing (Q2398107):
Displayed 12 items.
- A Joint Vehicle Routing and Speed Optimization Problem (Q5137953) (← links)
- Approximating the chance-constrained capacitated vehicle routing problem with robust optimization (Q6054019) (← links)
- Column elimination for capacitated vehicle routing problems (Q6057244) (← links)
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location (Q6068533) (← links)
- An exact solution method for home health care scheduling with synchronized services (Q6077479) (← links)
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem (Q6085887) (← links)
- Estimating the marginal cost to deliver to individual customers (Q6088526) (← links)
- Selective arc‐ng pricing for vehicle routing (Q6092607) (← links)
- Preprocessing to reduce vehicle capacity for routing problems (Q6097441) (← links)
- The two-echelon stochastic multi-period capacitated location-routing problem (Q6106489) (← links)
- Planning robust drone-truck delivery routes under road traffic uncertainty (Q6112843) (← links)
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)