Pages that link to "Item:Q5943821"
From MaRDI portal
The following pages link to A new approximation algorithm for the capacitated vehicle routing problem on a tree (Q5943821):
Displayed 15 items.
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees (Q860395) (← links)
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038) (← links)
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← 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)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)
- Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand (Q3105744) (← 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)
- Improving the approximation ratio for capacitated vehicle routing (Q5918417) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)
- A PTAS for Capacitated Vehicle Routing on Trees (Q6075752) (← links)