A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering
From MaRDI portal
Publication:5041760
DOI10.1007/978-3-030-45771-6_30zbMath1503.90122OpenAlexW3017374277MaRDI QIDQ5041760
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45771-6_30
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- Min-max tree covers of graphs.
- Improved bounds for vehicle routing solutions
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems
- Worst-case comparison of valid inequalities for the TSP
- A PTAS for bounded-capacity vehicle routing in planar graphs
- A generic exact solver for Vehicle Routing and related problems
- Improved branch-cut-and-price for capacitated vehicle routing
- Better approximability results for min-max tree/cycle/path cover problems
- A unified solution framework for multi-attribute vehicle routing problems
- The Truck Dispatching Problem
- PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$
- Bounds and Heuristics for Capacitated Routing Problems
- Capacitated Vehicle Routing on Trees
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- New approximation algorithms for the minimum cycle cover problem
