Pages that link to "Item:Q972645"
From MaRDI portal
The following pages link to An adaptive memory algorithm for the split delivery vehicle routing problem (Q972645):
Displaying 8 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)
- Testing local search move operators on the vehicle routing problem with split deliveries and time windows (Q337460) (← links)
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211) (← links)
- New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
- A novel approach to solve the split delivery vehicle routing problem (Q2968484) (← links)
- Vehicle routing problems with split deliveries (Q4918250) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
