Improving the approximation ratio for capacitated vehicle routing
From MaRDI portal
Publication:5925635
DOI10.1007/s10107-022-01841-4OpenAlexW3104752286WikidataQ114228490 ScholiaQ114228490MaRDI QIDQ5925635
Jens Vygen, Jannis Blauth, Vera Traub
Publication date: 14 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-022-01841-4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- Improved bounds for vehicle routing solutions
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- On the complexity of the separation problem for rounded capacity inequalities
- Approximating minimum-cost graph problems with spanning tree edges
- A PTAS for bounded-capacity vehicle routing in planar graphs
- Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
- PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k
- The School Bus Problem on Trees
- PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$
- Bounds and Heuristics for Capacitated Routing Problems
- Heuristic analysis, linear programming and branch and bound
- Capacitated Vehicle Routing on Trees
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Computing All Small Cuts in an Undirected Network
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- On some techniques useful for solution of transportation network problems
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
- A (slightly) improved approximation algorithm for metric TSP
This page was built for publication: Improving the approximation ratio for capacitated vehicle routing
