The euclidean traveling salesman problem and a space-filling curve
作者： Michael G. Norman , Pablo Moscato
DOI: 10.1016/0960-0779(95)80046-J
关键词:
摘要: Abstract We elucidate the relationship between space-fillling curves and Euclidean Traveling 2
harvard.edu
elsevier.com
sci-hub.se 参考文章(13)
David Hilbert, Über die stetige Abbildung einer Linie auf ein Flächenstück Springer, Berlin, Heidelberg. pp. 1- 2 ,(1935) , 10.1007/978-3-662-38452-7_1
Arto Salomaa, Grzegorz Rozenberg, Grzegorz Rozenberg, The mathematical theory of L systems ,(1980)
A. Lindenmayer, G. Rozenberg, Developmental systems and languages ,(1975)
Sven Skyum, Neil D. Jones, Complexity of some problems concerning L systems Theory of Computing Systems \/ Mathematical Systems Theory. ,vol. 13, pp. 29- 43 ,(1979) , 10.1007/BF01744286
Dietmar Saupe, Hartmut Jürgens, Heinz-Otto Peitgen, Chaos and Fractals: New Frontiers of Science ,(1992)
Jillian Beardwood, J. H. Halton, J. M. Hammersley, The shortest path through many points Mathematical Proceedings of the Cambridge Philosophical Society. ,vol. 55, pp. 299- 327 ,(1959) , 10.1017/S0305004100034095
Jan Van Leeuwen, The membership question for ETOL-languages is polynomially complete Information Processing Letters. ,vol. 3, pp. 138- 143 ,(1975) , 10.1016/0020-0190(75)90027-7
Neil D. Jones, Sven Skyum, A Note on the Complexity of General $D0L$ Membership SIAM Journal on Computing. ,vol. 10, pp. 114- 117 ,(1981) , 10.1137/0210009
David Hilbert, Ueber die stetige Abbildung einer Line auf ein Flächenstück Mathematische Annalen. ,vol. 38, pp. 459- 460 ,(1891) , 10.1007/BF01199431
Ernesto Bonomi, Jean-Luc Lutton, The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm SIAM Review. ,vol. 26, pp. 551- 568 ,(1984) , 10.1137/1026105