Pages that link to "Item:Q3786261"
From MaRDI portal
The following pages link to An exact algorithm for the asymmetrical capacitated vehicle routing problem (Q3786261):
Displaying 16 items.
- Fitness landscape analysis and metaheuristics efficiency (Q367228) (← links)
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- A way to optimally solve a time-dependent vehicle routing problem with time windows (Q1002083) (← links)
- The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) (← links)
- A new subtour elimination constraint for the vehicle routing problem (Q1278251) (← links)
- A study on the effect of the asymmetry on real capacitated vehicle routing problems (Q1761138) (← links)
- An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- On the exact solution of vehicle routing problems with backhauls (Q2189917) (← links)
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs (Q2494811) (← links)
- Split delivery routing (Q3035116) (← links)
- Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty (Q3386790) (← links)
- Vehicle routing with stochastic demands and restricted failures (Q4201811) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
