[58] Y. LeCun, S. Chopra, R. Hadsell, M. Ranzato, and F. Huang, "A tutorial on energy-based learning," Predicting structured data, vol. 1, no. 0, 2006.
[59] A. Graikos, N. Malkin, N. Jojic, and D. Samaras, "Diffusion models as plug-and-play priors," arXiv preprint arXiv:2206.09012, 2022.
[60] S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the traveling-salesman problem," Operations research, vol. 21, no. 2, pp. 498-516, 1973.
[61] P. R. d. O. da Costa, J. Rhuggenaath, Y. Zhang, and A. Akcay, “Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning,” arXiv preprint arXiv:2004.01608, 2020.
[62] D. Applegate, R. Bixby, V. Chvatal, and W. Cook, “Concorde tsp solver,” 2006.
[63] K. Helsgaun, "An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems," Roskilde: Roskilde University, pp. 24-50, 2017.
[64] G. A. Croes, “A method for solving traveling-salesman problems,” Operations research, vol. 6, no. 6, pp. 791–812, 1958.
[65] X. Bresson and T. Laurent, “The transformer network for the traveling salesman problem,” arXiv preprint arXiv:2103.03012, 2021.
[66] Gurobi Optimization, "Gurobi optimizer reference manual," http://www.gurobi.com, 2020.
[67] M. Deudon, P. Cournut, A. Lacoste, Y. Adulyasak, and L.-M. Rousseau, “Learning heuristics for the tsp by policy gradient,” in International conference on the integration of constraint programming, artificial intelligence, and operations research. Springer, 2018, pp. 170–181.
[68] B. Hudson, Q. Li, M. Malencia, and A. Prorok, "Graph neural network guided local search for the traveling salesperson problem," arXiv preprint arXiv:2110.05291, 2021.
[69] S. Lamm, P. Sanders, C. Schulz, D. Strash, and R. F. Werneck, “Finding near-optimal independent sets at scale,” in 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, 2016, pp. 138–150.
[70] Z. Li, Q. Chen, and V. Koltun, "Combinatorial optimization with graph convolutional networks and guided tree search," Advances in neural information processing systems, vol. 31, 2018.
[71] M. Böther, O. Kißig, M. Taraz, S. Cohen, K. Seidel, and T. Friedrich, “What’s wrong with deep learning in tree search for combinatorial optimization,” arXiv preprint arXiv:2201.10494, 2022.
[72] S. Ahn, Y. Seo, and J. Shin, “Learning what to defer for maximum independent sets,” in International Conference on Machine Learning, 2020, pp. 134–144.
[73] H. H. Hoos and T. Stützle, "Satlib: An online resource for research on sat," Sat, vol. 2000, pp. 283-292, 2000.
[74] P. Erdős, A. Rényi et al., “On the evolution of random graphs,” Publ. Math. Inst. Hung. Acad. Sci, vol. 5, no. 1, pp. 17-60, 1960.
[75] Q. Wu, W. Zhao, Z. Li, D. Wipf, and J. Yan, "Nodeformer: A scalable graph structure learning transformer for node classification," in Advances in Neural Information Processing Systems, 2022.
[76] Q. Wu, C. Yang, W. Zhao, Y. He, D. Wipf, and J. Yan, "DIFFormer: Scalable (graph) transformers induced by energy constrained diffusion," in International Conference on Learning Representations, 2023.
[77] Q. Wu, W. Zhao, C. Yang, H. Zhang, F. Nie, H. Jiang, Y. Bian, and J. Yan, “Simplifying and empowering transformers for large-graph representations,” in Advances in Neural Information Processing Systems (NeurIPS), 2023.
[78] J. Zhou, Y. Wu, W. Song, Z. Cao, and J. Zhang, "Towards omni-generalizable neural methods for vehicle routing problems," arXiv preprint arXiv:2305.19587, 2023.