Pages that link to "Item:Q2337401"
From MaRDI portal
The following pages link to An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401):
Displaying 7 items.
- A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles (Q2029063) (← links)
- Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
- A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows (Q2083929) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions (Q2676276) (← links)
- The workforce scheduling and routing problem with park-and-loop (Q6663965) (← links)
