Improved bounds for vehicle routing solutions

DOI10.1016/j.disopt.2006.04.002zbMath1112.90006DBLPjournals/disopt/BompadreDO06OpenAlexW2049733361WikidataQ59592457 ScholiaQ59592457MaRDI QIDQ865747

Agustín 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

zbMATH Keywords

approximation algorithmlower boundvehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (13)

Differential approximation algorithm of FSMVRP ⋮ A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering ⋮ Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems ⋮ A PTAS for Capacitated Vehicle Routing on Trees ⋮ Iterated tour partitioning for Euclidean capacitated vehicle routing ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems ⋮ Capacitated Vehicle Routing with Nonuniform Speeds ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ 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 ⋮ A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• Bounds and Heuristics for Capacitated Routing Problems
• Savings by Split Delivery Routing
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
• Faster scaling algorithms for general graph matching problems

This page was built for publication: Improved bounds for vehicle routing solutions