Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference33 articles.
1. Applegate DL, Bixby RM, Chvátal V, Cook WJ (2006) The traveling salesman problem. ISBN 0-691-12993-2
2. Artin E (1960/61) Analytic Geometry und Algebra I, II. Lessons at he university of Hamburg, 1960/61. Part I worked out by H. Behncke und W. Hansen, Part II worked out by H. Kiendl und W. Hansen
3. Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J ACM 45(5):753–782
4. Beardwood J, Halton JH, Hammersley JM (1959) The shortest path through many points. Proc Camb Philos Soc 55:299–327
5. Bellman R (1960) Combinatorial processes and dynamic programming. In: Bellman R, Hall M Jr (eds) Combinatorial analysis, Proceedings of symposia in applied mathematics 10. American Mathematical Society, Providence, pp 217–249