1. Papadimitriou CH (1977) The euclidean travelling salesman problem is np-complete. Theoretical Comput Sci 4(3):237–244
2. Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report
3. Perron L, Furnon V (2022) Or-tools. https://developers.google.com/optimization/, 2022-11-25
4. Kool W, Van Hoof H, Welling M (2018) Attention, learn to solve routing problems! arXiv:1803.08475
5. Bresson X, Laurent T (2021) The transformer network for the traveling salesman problem. arXiv:2103.03012