Euclidean capacitated vehicle routing in the random setting: a 1.55-approximation algorithm
From MaRDI portal
Cites work
- A framework for vehicle routing approximation schemes in trees
- A gap-ETH-tight approximation scheme for Euclidean TSP
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A linear time approximation scheme for Euclidean TSP
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
- A PTAS for bounded-capacity vehicle routing in planar graphs
- A PTAS for Capacitated Vehicle Routing on Trees
- A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- A tight 4/3 approximation for capacitated vehicle routing in trees
- A tight (1.5+)-approximation for unsplittable capacitated vehicle routing on trees
- An approximation algorithm for distance-constrained vehicle routing on trees
- Approximation algorithms for distance constrained vehicle routing problems
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
- Approximation schemes for NP-hard geometric optimization problems: a survey
- Bounds and Heuristics for Capacitated Routing Problems
- Capacitated vehicle routing in graphic metrics
- Classical and modern heuristics for the vehicle routing problem
- Combinatorial optimization. Theory and algorithms.
- Eine Extremaleigenschaft der Kurven konstanter Breite.
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Handbooks in operations Research \& management science: Transportation
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- scientific article; zbMATH DE number 3588048 (Why is no real title available?)
- scientific article; zbMATH DE number 1559543 (Why is no real title available?)
- scientific article; zbMATH DE number 1775442 (Why is no real title available?)
- scientific article; zbMATH DE number 3193293 (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
- Iterated tour partitioning for Euclidean capacitated vehicle routing
- On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs
- On the Distance Constrained Vehicle Routing Problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Probabilistic analysis of a capacitated vehicle routing problem. II
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
- PTAS for k-tour cover problem on the plane for moderately large values of k^*
- PTAS for the Euclidean capacitated vehicle routing problem in R^d
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- The design of approximation algorithms
- The Euclidean traveling salesman problem is NP-complete
- The vehicle routing problem
- The vehicle routing problem. Latest advances and new challenges.
- The vehicle routing problem: An overview of exact and approximate algorithms
- Unsplittable Euclidean capacitated vehicle routing: a (2+)-approximation algorithm
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
This page was built for publication: Euclidean capacitated vehicle routing in the random setting: a 1.55-approximation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253160)
