The following pages link to (Q5289291):
Displaying 10 items.
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads (Q339703) (← links)
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems (Q841604) (← links)
- An adaptive memory algorithm for the split delivery vehicle routing problem (Q972645) (← links)
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil (Q1042225) (← links)
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783) (← links)
- The split delivery vehicle scheduling problem with time windows and grid network distances (Q1892675) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A hybrid VND method for the split delivery vehicle routing problem (Q2631222) (← links)
- Vehicle routing problems with split deliveries (Q4918250) (← links)
- A column generation approach for the split delivery vehicle routing problem (Q5900196) (← links)
