Pages that link to "Item:Q6066728"
From MaRDI portal
The following pages link to Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem (Q6066728):
Displaying 13 items.
- Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem (Q2070127) (← links)
- New formulations and solution approaches for the latency location routing problem (Q2147033) (← links)
- A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem (Q2669499) (← links)
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
- A general VNS for the multi-depot open vehicle routing problem with time windows (Q6063504) (← links)
- Multi-objective home health care routing: a variable neighborhood search method (Q6063518) (← links)
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks (Q6088235) (← links)
- A variable neighborhood search for flying sidekick traveling salesman problem (Q6088243) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
- A variable neighborhood search approach for solving a real-world hierarchical multi-echelon vehicle routing problem involving HCT vehicles (Q6561246) (← links)
- General VNS for asymmetric vehicle routing problem with time and capacity constraints (Q6568438) (← links)
- An adaptive large neighborhood search for the multi-point dynamic aggregation problem (Q6636938) (← links)
