1. Papadimitriou, C.H.: The Euclidean travelling salesman problem is NP-complete. In: Theoretical Computer Science, pp. 237–244 (1977)
2. Dai, H., Khalil, E., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Advances in Neural Information Processing Systems, pp. 6348–6358 (2017)
3. Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: International Conference on Learning Representations (2019)
4. Joshi, C.K., Laurent, T., Bresson, X.: An efficient graph convolutional network technique for the travelling salesman problem (2019). arXiv preprint. arXiv:1906.01227
5. Wu, Y., Song, W., Cao, Z., Zhang, J., Lim, A.: Learning improvement heuristics for solving routing problems. In: IEEE Transactions on Neural Networks and Learning Systems, pp. 1–13 (2021)