An O(N log N) planar travelling salesman heuristic based on spacefilling curves
- 30 September 1982
- journal article
- Published by Elsevier BV in Operations Research Letters
- Vol. 1 (4), 121-125
- https://doi.org/10.1016/0167-6377(82)90012-8
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977