Pages that link to "Item:Q1266654"
From MaRDI portal
The following pages link to A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654):
Displaying 12 items.
- The capacitated general windy routing problem with turn penalties (Q433125) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem (Q709128) (← links)
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery (Q850302) (← links)
- A way to optimally solve a time-dependent vehicle routing problem with time windows (Q1002083) (← links)
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls (Q1124810) (← links)
- A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
- An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem (Q2820103) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
