Pages that link to "Item:Q1411621"
From MaRDI portal
The following pages link to On the capacitated vehicle routing problem (Q1411621):
Displaying 24 items.
- Capacitated vehicle routing with nonuniform speeds (Q2800377) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- On a Labeled Vehicle Routing Problem (Q3401097) (← links)
- (Q3404305) (← links)
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (Q3564361) (← links)
- (Q3840278) (← links)
- Capacitated Vehicle Routing on Trees (Q3980515) (← links)
- (Q4249536) (← links)
- (Q4577928) (← links)
- Solving an On-Line Capacitated Vehicle Routing Problem with Structured Time Windows (Q4596452) (← links)
- Three algorithms for graph locally harmonious colouring (Q4978237) (← links)
- Formulations for an inventory routing problem (Q4979996) (← links)
- A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants (Q4995082) (← links)
- A column generation approach for the split delivery vehicle routing problem (Q5894493) (← links)
- Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem (Q6053495) (← links)
- Column elimination for capacitated vehicle routing problems (Q6057244) (← links)
- Preprocessing to reduce vehicle capacity for routing problems (Q6097441) (← links)
- Real-time passenger bus routing problems with preferences and tradeoffs (Q6113072) (← links)
- Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem (Q6180050) (← links)
- General VNS for asymmetric vehicle routing problem with time and capacity constraints (Q6568438) (← links)
- A feasibility-preserved quantum approximate Solver for the capacitated vehicle routing problem (Q6588867) (← links)
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem (Q6659085) (← links)
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff (Q6667800) (← links)