The maximum scatter TSP on a regular grid
From MaRDI portal
Abstract: In the maximum scatter traveling salesman problem the objective is to find a tour that maximizes the shortest distance between any two consecutive nodes. This model can be applied to manufacturing processes, particularly laser melting processes. We extend an algorithm by Arkin et al. that yields optimal solutions for nodes on a line to a regular -grid. The new algorithm takes linear time to compute an optimal tour in some cases. It is asymptotically optimal and a -approximation for the -grid, which is the worst case.
Recommendations
Cited in
(6)- The traveling salesman problem on grids with forbidden neighborhoods
- New approximation results for the maximum scatter TSP
- On the Maximum Scatter Traveling Salesperson Problem
- Maximum Scatter TSP in Doubling Metrics
- Perturbation analysis of practical algorithms for the maximum scatter travelling salesman problem
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
This page was built for publication: The maximum scatter TSP on a regular grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596195)