Pages that link to "Item:Q1652352"
From MaRDI portal
The following pages link to A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups (Q1652352):
Displaying 9 items.
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213) (← links)
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension (Q2046271) (← links)
- Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension (Q2048811) (← links)
- A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← links)
- Modelling and solving the milk collection problem with realistic constraints (Q2147008) (← links)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- The vehicle routing problem with simultaneous pickup and delivery and handling costs (Q2289929) (← links)
- Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic (Q6088236) (← links)
