Improved approximation algorithms for multidepot capacitated vehicle routing
From MaRDI portal
Cites work
- A (slightly) improved approximation algorithm for metric TSP
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
- A deterministic better-than-3/2 approximation algorithm for metric TSP
- A Greedy Heuristic for the Set-Covering Problem
- A local search-based approach for set covering
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem
- Bifactor approximation for location routing with vehicle and facility capacities
- Bounds and Heuristics for Capacitated Routing Problems
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- scientific article; zbMATH DE number 3746840 (Why is no real title available?)
- scientific article; zbMATH DE number 1559543 (Why is no real title available?)
- Improved approximations for capacitated vehicle routing with unsplittable client demands
- Improved bounds for vehicle routing solutions
- Improving the approximation ratio for capacitated vehicle routing
- Reducing Path TSP to TSP
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- The design of approximation algorithms
- Worst-case analysis of a new heuristic for the travelling salesman problem
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
This page was built for publication: Improved approximation algorithms for multidepot capacitated vehicle routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591657)
