Publisher
Springer International Publishing
Reference20 articles.
1. Johnson, D.S., McGeoch, L.-A.: The Traveling Salesman Problem and its Variations, Combinatorial Optimization. 1st edn. Springer Press, London (2004)
2. Karp, R.: On the computational complexity of combinatorial problems. Networks 5(1), 45–68 (1975)
3. Held, M., Karp, R.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math 10(1), 196–210 (1962)
4. Bellman, R.: Dynamic programming treatment of the traveling salesman problem. J. ACM 9(1), 61–63 (1962)
5. Klerk, E.-D., Dobre, C.: A comparison of lower bounds for the symmetric circulant traveling salesman problem. Discret. Appl. Math 159(16), 1815–1826 (2011)