Improved approximation algorithms for capacitated vehicle routing with fixed capacity
From MaRDI portal
Cites work
- A (slightly) improved approximation algorithm for metric TSP
- A 4/5 -- approximation algorithm for the maximum traveling salesman problem
- A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
- A deterministic better-than-3/2 approximation algorithm for metric TSP
- A General Approximation Technique for Constrained Forest Problems
- A Greedy Heuristic for the Set-Covering Problem
- A local search-based approach for set covering
- A PTAS for capacitated vehicle routing on trees
- A tight (1.5+)-approximation for unsplittable capacitated vehicle routing on trees
- An approximation algorithm for maximum packing of 3-edge paths
- An optimal minimum spanning tree algorithm
- Approximation algorithms for some vehicle routing problems
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
- Better approximations for max TSP
- Bounds and Heuristics for Capacitated Routing Problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- 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
- Low treewidth embeddings of planar and minor-free metrics
- New benchmark instances for the capacitated vehicle routing problem
- On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs
- On the completeness of a generalized matching problem
- Probabilistic Analysis of Euclidean Capacitated Vehicle Routing
- The truck dispatching problem
- Vehicle Routing
- 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 capacitated vehicle routing with fixed capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310268)
