New differential approximation algorithm for \(k\)-customer vehicle routing problem
From MaRDI portal
Publication:976133
DOI10.1016/j.ipl.2008.12.018zbMath1191.68872OpenAlexW1995347977MaRDI QIDQ976133
Publication date: 16 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.018
Related Items (2)
Differential approximation algorithm of FSMVRP ⋮ Approximation of the double traveling salesman problem with multiple stacks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential approximation results for the traveling salesman and related problems
- Differential approximation of MIN SAT, MAX SAT and related problems
- A better differential approximation ratio for symmetric TSP
- Structure preserving reductions among convex optimization problems
- Differential approximation algorithms for some combinatorial optimization problems
- Approximation results for the minimum graph coloring problem
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- Approximation algorithms for some vehicle routing problems
- On the differential approximation of MIN SET COVER
- The maximum saving partition problem
- Differential approximation for optimal satisfiability and related problems
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing
- z-Approximations
- Independent Sets in Bounded-Degree Hypergraphs
- Bounds and Heuristics for Capacitated Routing Problems
- A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
- Mathematical Foundations of Computer Science 2003
This page was built for publication: New differential approximation algorithm for \(k\)-customer vehicle routing problem
