scientific article; zbMATH DE number 1559543
From MaRDI portal
Publication:4526992
Recommendations
- PTAS for k-tour cover problem on the plane for moderately large values of k
- PTAS for k-tour cover problem on the plane for moderately large values of k^*
- Approximation schemes for the generalized traveling salesman problem
- A PTAS for TSP with neighborhoods among fat regions in the plane
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Cited in
(27)- Iterated tour partitioning for Euclidean capacitated vehicle routing
- PTAS for k-tour cover problem on the plane for moderately large values of k^*
- Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows
- PTAS for k-tour cover problem on the plane for moderately large values of k
- Multidepot capacitated vehicle routing with improved approximation guarantees
- Improved bounds for vehicle routing solutions
- Improved approximation algorithms for multidepot capacitated vehicle routing
- A PTAS for Capacitated Vehicle Routing on Trees
- Scheduling with locality by routing
- Not all insertion methods yield constant approximate tours in the Euclidean plane
- A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension
- Euclidean capacitated vehicle routing in the random setting: a 1.55-approximation algorithm
- Improved approximations for the capacitated vehicle routing problem with fixed capacity
- Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
- Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
- Improving the approximation ratio for capacitated vehicle routing
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- The APX-hardness of the traveling tournament problem
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
- The school bus problem on trees
- Improved approximations for capacitated vehicle routing with unsplittable client demands
- Improving the approximation ratio for capacitated vehicle routing
- Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
- Multi-shuttle crane scheduling in automated storage and retrieval systems
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526992)
