The following pages link to (Q4249536):
Displaying 11 items.
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees (Q860395) (← links)
- Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
- Capacitated vehicle routing problem on line with unsplittable demands (Q2082210) (← links)
- A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line (Q2109294) (← links)
- Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand (Q3105744) (← links)
- Heuristics for vehicle routing on tree-like networks (Q3157366) (← links)
- Capacitated Vehicle Routing on Trees (Q3980515) (← links)
- Two exact algorithms for the vehicle routing problem on trees (Q4238575) (← links)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697) (← links)
- A polynomial-time exact algorithm for \(k\)-depot capacitated vehicle routing problem on a tree (Q6483737) (← links)
