Improved bounds for vehicle routing solutions
DOI10.1016/J.DISOPT.2006.04.002zbMATH Open1112.90006DBLPjournals/disopt/BompadreDO06OpenAlexW2049733361WikidataQ59592457 ScholiaQ59592457MaRDI QIDQ865747FDOQ865747
Authors: A. Bompadre, Moshe Dror, James B. Orlin 
Publication date: 20 February 2007
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.04.002
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Savings by Split Delivery Routing
- Faster scaling algorithms for general graph matching problems
- Title not available (Why is that?)
- Bounds and Heuristics for Capacitated Routing Problems
- Title not available (Why is that?)
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Title not available (Why is that?)
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- Title not available (Why is that?)
- Heuristics for unequal weight delivery problems with a fixed error guarantee
Cited In (19)
- 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
- A Fast $$(2 + 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
- Improving the approximation ratio for capacitated vehicle routing
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
- Title not available (Why is that?)
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
- Improving the approximation ratio for capacitated vehicle routing
- Extensions of the Petal Method for Vehicle Routeing
- Iterated tour partitioning for Euclidean capacitated vehicle routing
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)
