Equidistribution in All Dimensions of Worst-Case Point Sets for the Traveling Salesman Problem.
Timothy Law SnyderJ. Michael SteelePublished in: SIAM J. Discret. Math. (1995)
Keyphrases
- traveling salesman problem
- point sets
- worst case
- combinatorial optimization
- point correspondences
- point pattern matching
- lower bound
- ant colony optimization
- hamiltonian cycle
- upper bound
- optimization problems
- iterative closest point algorithm
- graph matching
- traveling salesman
- pairwise
- metric space
- convex hull
- genetic local search
- distance function
- point set registration
- np hard
- computational complexity
- random walk
- affine registration
- viewpoint
- object recognition
- subtour elimination
- neural network