An approximation algorithm for the clustered path travelling salesman problem
From MaRDI portal
Recommendations
- An approximation algorithm for the clustered path travelling salesman problem
- scientific article; zbMATH DE number 1302021
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- An improved approximation algorithm for the clustered traveling salesman problem
- Approximation algorithms for not necessarily disjoint clustered TSP
Cites work
- A 1.5-approximation for path TSP
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Approaching 3/2 for the \(s\)-\(t\)-path TSP
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- Better \(s-t\)-tours by Gao trees
- Emergency relief routing models for injured victims considering equity and priority
- Graph theory
- Improving approximation ratios for the clustered traveling Salesman problem
- Improving Christofides' algorithm for the s-t path TSP
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- Paths, Trees, and Flowers
- Priority assignment in emergency response
- Restricted delivery problems on a network
- Solution of large-scale symmetric travelling salesman problems
- Supereulerian digraphs
- The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
- The symmetric clustered traveling salesman problem
- The traveling salesman problem with backhauls
Cited in
(11)- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- Approximation algorithms for general cluster routing problem
- An LP-based approximation algorithm for the generalized traveling salesman path problem
- scientific article; zbMATH DE number 1302021 (Why is no real title available?)
- Approximation algorithms for not necessarily disjoint clustered TSP
- An improved approximation algorithm for the clustered traveling salesman problem
- Local search for Hamiltonian Path with applications to clustering visitation paths
- An approximation algorithm for the clustered path travelling salesman problem
- PTAS for Euclidean travelling salesman problem with soft time windows
- An approximation algorithm for the (metric) clustered path traveling salesman problem
This page was built for publication: An approximation algorithm for the clustered path travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6039533)
