scientific article; zbMATH DE number 1302021
From MaRDI portal
Publication:4247262
Recommendations
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- An approximation algorithm for the clustered path travelling salesman problem
- An approximation algorithm for the clustered path travelling salesman problem
- An improved approximation algorithm for the clustered traveling salesman problem
- Approximation algorithms for not necessarily disjoint clustered TSP
Cited in
(14)- 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 schemes for the generalized traveling salesman problem
- Approximation algorithms for general cluster routing problem
- Approximation algorithms with constant ratio for general cluster routing problems
- A note on approximation algorithms of the clustered traveling salesman problem
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
- Approximation algorithms for not necessarily disjoint clustered TSP
- An improved approximation algorithm for the clustered traveling salesman problem
- scientific article; zbMATH DE number 1379308 (Why is no real title available?)
- An approximation algorithm for the clustered path travelling salesman problem
- 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
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 Q4247262)
