A 53-approximation algorithm for the clusterd traveling salesman tour and path problems
From MaRDI portal
Publication:1306365
Recommendations
Cites work
- An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- scientific article; zbMATH DE number 1302021 (Why is no real title available?)
- Procedures for travelling salesman problems with additional constraints
- Restricted delivery problems on a network
- Tight bounds for christofides' traveling salesman heuristic
Cited in
(24)- On residual approximation in solution extension problems
- Approximation algorithms with constant ratio for general cluster routing problems
- An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem
- Traveling salesman path problems
- Vertices removal for feasibility of clustered spanning trees
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- On Residual Approximation in Solution Extension Problems
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- Approximation algorithms for not necessarily disjoint clustered TSP
- An exact algorithm for the clustered travelling salesman problem
- Improving approximation ratios for the clustered traveling Salesman problem
- Cluster-level operations planning for the out-of-position robotic arc-welding
- An approximation algorithm for the clustered path travelling salesman problem
- Achieving feasibility for clustered traveling salesman problems using PQ‐trees
- Traveling salesman problem with clustering
- An approximation algorithm for the clustered path travelling salesman problem
- New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule
- A hybrid metaheuristic for the clustered travelling salesman problem
- An approximation algorithm for the (metric) clustered path traveling salesman problem
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- A survey on the traveling salesman problem and its variants in a warehousing context
- Computing Hamiltonian paths with partial order restrictions
- Better approximation algorithms for clustered TSP and subgroup planning
- The non-disjoint clustered traveling salesperson problem
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)
