Pages that link to "Item:Q991469"
From MaRDI portal
The following pages link to Improved lower bounds for the split delivery vehicle routing problem (Q991469):
Displaying 14 items.
- Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858) (← links)
- An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
- Improved bounds for vehicle routing solutions (Q865747) (← links)
- New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
- The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
- Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q2669556) (← links)
- A novel approach to solve the split delivery vehicle routing problem (Q2968484) (← links)
- Savings by Split Delivery Routing (Q3821924) (← links)
- Particle Swarm Optimization for Split Delivery Vehicle Routing Problem (Q4642133) (← links)
- Vehicle routing problems with split deliveries (Q4918250) (← links)
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results (Q5295488) (← links)