A 53-approximation algorithm for the clusterd traveling salesman tour and path problems
From MaRDI portal
Publication:1306365
DOI10.1016/S0167-6377(98)00046-7zbMATH Open0956.90035OpenAlexW2162344698MaRDI QIDQ1306365FDOQ1306365
Authors: Shoshana Anily, Julien Bramel, Alain Hertz 
Publication date: 1999
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00046-7
Recommendations
analysis of algorithmstransportationvehicle routingsuboptimal algorithmsordered cluster traveling salesman problem
Cites Work
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Procedures for travelling salesman problems with additional constraints
- Restricted delivery problems on a network
- An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
- Tight bounds for christofides' traveling salesman heuristic
- Title not available (Why is that?)
Cited In (18)
- Approximation algorithms for not necessarily disjoint clustered TSP
- Improving approximation ratios for the clustered traveling Salesman problem
- Achieving feasibility for clustered traveling salesman problems using PQ‐trees
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- On residual approximation in solution extension problems
- A hybrid metaheuristic for the clustered travelling salesman problem
- New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule
- Cluster-level operations planning for the out-of-position robotic arc-welding
- Traveling salesman problem with clustering
- Vertices removal for feasibility of clustered spanning trees
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- On Residual Approximation in Solution Extension Problems
- Traveling salesman path problems
- An exact algorithm for the clustered travelling salesman problem
- An approximation algorithm for the clustered path travelling salesman problem
- An approximation algorithm for the clustered path travelling salesman problem
- An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem
- Approximation algorithms with constant ratio for general cluster routing problems
This page was built for publication: A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306365)
