Iterated tour partitioning for Euclidean capacitated vehicle routing
From MaRDI portal
Publication:6076221
DOI10.1002/rsa.21130zbMath1528.90040OpenAlexW4312106911MaRDI QIDQ6076221
Publication date: 23 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.21130
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Geometric probability and stochastic geometry (60D05) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- Improved bounds for vehicle routing solutions
- The vehicle routing problem. Latest advances and new challenges.
- Probabilistic analysis of a capacitated vehicle routing problem. II
- Weak laws of large numbers in geometric probability
- The Vehicle Routing Problem
- 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$$
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Probabilistic analysis for a multiple depot vehicle routing problem
- Bounds and Heuristics for Capacitated Routing Problems
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- On the Distance Constrained Vehicle Routing Problem
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- New Bounds for the Traveling Salesman Constant
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
- Improving the approximation ratio for capacitated vehicle routing
This page was built for publication: Iterated tour partitioning for Euclidean capacitated vehicle routing
