Publisher
Springer Nature Switzerland
Reference41 articles.
1. Moret, B.M., Shapiro, H.D.: Algorithms from P to NP (vol. 1) Design and Efficiency. Benjamin-Cummings Publishing Co. Inc. (1991)
2. Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM (JACM) 9(1), 61–63 (1962)
3. Laporte, G., Martello, S.: The selective travelling salesman problem. Discr. Appl. Math. 26(2–3), 193–207 (1990). https://doi.org/10.1016/0166-218X(90)90100-Q
4. Berge, C.: Graphs et hypergraphs. Dunod, Paris (1970)
5. Cornuéjols, G., Naddef, D., Pulleyblank, W.R.: Halin graphs and the travelling salesman problem. Math. Program. 26, 287–294 (1983). https://doi.org/10.1007/BF02591867