The euclidean traveling salesman problem and a space-filling curve
- 31 December 1995
- journal article
- Published by Elsevier in Chaos, Solitons, and Fractals
- Vol. 6, 389-397
- https://doi.org/10.1016/0960-0779(95)80046-j
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis AlgorithmSIAM Review, 1984
- A Note on the Complexity of General $D0L$ MembershipSIAM Journal on Computing, 1981
- Complexity of some problems concerningL systemsTheory of Computing Systems, 1979
- The membership question for ETOL-languages is polynomially completeInformation Processing Letters, 1975
- Developmental algorithms for multicellular organisms: A survey of L-systemsJournal of Theoretical Biology, 1975
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959
- Ueber die stetige Abbildung einer Line auf ein Fl chenst ckMathematische Annalen, 1891