Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem
From MaRDI portal
Publication:2689288
Recommendations
- A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
- A constant-factor approximation algorithm for the asymmetric traveling salesman problem
- An improved approximation algorithm for ATSP
- Approximation algorithms for mixed, windy, and capacitated arc routing problems
- Constant factor approximation for ATSP with two edge weights (extended abstract)
Cites work
- A constant-factor approximation algorithm for the asymmetric traveling salesman problem
- A generic exact solver for vehicle routing and related problems
- A note on the prize collecting traveling salesman problem
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- Abusing the Tutte matrix: an algebraic instance compression for the K-set-cycle problem
- An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- An exact algorithm with linear complexity for a problem of visiting megalopolises
- An improved approximation algorithm for ATSP
- Approximability of the minimum Steiner cycle problem
- Approximation algorithms for generalized MST and TSP in grid clusters
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- scientific article; zbMATH DE number 3746840 (Why is no real title available?)
- Improved branch-cut-and-price for capacitated vehicle routing
- Optimal solutions for routing problems with profits
- Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions
- P-Complete Approximation Problems
- Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem
- PTAS for k-tour cover problem on the plane for moderately large values of k^*
- Solution of a Large-Scale Traveling-Salesman Problem
- The dynamic programming method in the generalized traveling salesman problem
- The Euclidean traveling salesman problem is NP-complete
- The prize collecting traveling salesman problem
- The time-dependent orienteering problem with time windows: a fast ant colony system
- The traveling salesman problem and its variations.
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- The truck dispatching problem
- VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties
Cited in
(6)- Approximation algorithms with constant factors for a series of asymmetric routing problems
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles
- Improved first player strategy for the zero-sum sequential uncrossing game
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- Implementation and numerical evaluation of Traub and Vygen algorithm for the subtour cover problem
- Constant-ratio polynomial time approximation of the asymmetric minimum weight cycle cover problem with limited number of cycles
This page was built for publication: Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689288)
