Improved bounds for vehicle routing solutions
From MaRDI portal
(Redirected from Publication:865747)
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 4057252 (Why is no real title available?)
- scientific article; zbMATH DE number 4066603 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1559543 (Why is no real title available?)
- scientific article; zbMATH DE number 871938 (Why is no real title available?)
- Bounds and Heuristics for Capacitated Routing Problems
- Faster scaling algorithms for general graph matching problems
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Savings by Split Delivery Routing
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
Cited in
(20)- Iterated tour partitioning for Euclidean capacitated vehicle routing
- Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
- Differential approximation algorithm of FSMVRP
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
- Minimizing customers' waiting time in a vehicle routing problem with unit demands
- Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
- Improved approximation algorithms for multidepot capacitated vehicle routing
- A PTAS for Capacitated Vehicle Routing on Trees
- Capacitated vehicle routing with nonuniform speeds
- Improved lower bounds for the split delivery vehicle routing problem
- Lower and upper bounds for the m-peripatetic vehicle routing problem
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- A fast \((2 + 2/7)\)-approximation algorithm for capacitated cycle covering
- Improving the approximation ratio for capacitated vehicle routing
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
- scientific article; zbMATH DE number 5343224 (Why is no real title available?)
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
- Improving the approximation ratio for capacitated vehicle routing
- Extensions of the Petal Method for Vehicle Routeing
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
This page was built for publication: Improved bounds for vehicle routing solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865747)