Improved approximation algorithms for multidepot capacitated vehicle routing
From MaRDI portal
Publication:6591657
DOI10.1007/978-3-031-49193-1_29MaRDI QIDQ6591657
Publication date: 22 August 2024
Cites Work
- Unnamed Item
- Unnamed Item
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- Improved bounds for vehicle routing solutions
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Worst-case analysis of a new heuristic for the travelling salesman problem
- Improved approximations for capacitated vehicle routing with unsplittable client demands
- Bifactor approximation for location routing with vehicle and facility capacities
- A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots
- The Design of Approximation Algorithms
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Bounds and Heuristics for Capacitated Routing Problems
- A Greedy Heuristic for the Set-Covering Problem
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
- Reducing Path TSP to TSP
- Improving the approximation ratio for capacitated vehicle routing
- A (slightly) improved approximation algorithm for metric TSP
- A deterministic better-than-3/2 approximation algorithm for metric TSP
- An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem
- A local search-based approach for set covering
This page was built for publication: Improved approximation algorithms for multidepot capacitated vehicle routing
