Edge sparsification for geometric tour problems
From MaRDI portal
Recommendations
- Edge elimination in TSP instances
- A tabu search with geometry‐based sparsification methods for angular traveling salesman problems
- Good triangulations yield good tours
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
Cites work
- 2-opt moves and flips for area-optimal polygonizations
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- A space efficient greedy triangulation algorithm
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
- An empirical study on randomized optimal area polygonization of planar point sets
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
- Angle-restricted tours in the plane.
- Area optimal polygonization using simulated annealing
- Area-optimal simple polygonalizations: the CG challenge 2019
- Computing area-optimal simple polygonizations
- Computing nonsimple polygons of minimum perimeter
- Discrete optimization methods to determine trajectories for Dubins' vehicles
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- Experimental study of geometric \(t\)-spanners
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane
- Geometric Spanner Networks
- Good triangulations yield good tours
- Greedy and local search heuristics to build area-optimal polygons
- scientific article; zbMATH DE number 4070353 (Why is no real title available?)
- scientific article; zbMATH DE number 2145237 (Why is no real title available?)
- Improved upper bound on the stretch factor of Delaunay triangulations
- Lower bounds on the dilation of plane spanners
- Minimum scan cover with angular transition costs
- Minimum-weight triangulation is NP-hard
- On Generalized Diamond Spanners
- On plane geometric spanners: a survey and open problems
- On simple polygonalizations with optimal area
- On the convex layers of a planar set
- Optimal Area Polygonization by Triangulation and Visibility Search
- Optimal Covering Tours with Turn Costs
- Solving large-scale minimum-weight triangulation instances to provable optimality
- Strong Connectivity in Directional Nearest-Neighbor Graphs
- The Angular-Metric Traveling Salesman Problem
- The greedy triangulation can be computed from the Delaunay triangulation in linear time
- The stretch factor of \(L _{1}\)- and \(L _{ \infty }\)-Delaunay triangulations
- There are planar graphs almost as good as the complete graph
- Traveling Salesperson Problems for the Dubins Vehicle
- Triangle-Based Heuristics for Area Optimal Polygonizations
- TSPLIB—A Traveling Salesman Problem Library
This page was built for publication: Edge sparsification for geometric tour problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6124757)
