[20] G. Harshvardhan, M. K. Gourisaria, M. Pandey, and S. S. Rautaray, “A comprehensive survey and analysis of generative models in machine learning,” Computer Science Review, vol. 38, p. 100285, 2020.
[21] T. Iqbal and S. Qureshi, “The survey: Text generation models in deep learning,” Journal of King Saud University-Computer and Information Sciences, vol. 34, no. 6, pp. 2515–2528, 2022.
[22] X. Guo and L. Zhao, "A systematic survey on deep generative models for graph generation," IEEE Transactions on Pattern Analysis and Machine Intelligence, 2022.
[23] A. Hottung, B. Bhandari, and K. Tierney, "Learning a latent search space for routing problems using variational autoencoders," in International Conference on Learning Representations, 2021.
[24] Y. Li, X. Chen, W. Guo, X. Li, W. Luo, J. Huang, H.-L. Zhen, M. Yuan, and J. Yan, "Hardsatgen: Understanding the difficulty of hard sat formula generation and a strong structure-hardness-aware baseline," in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2023.
[25] J. You, H. Wu, C. Barrett, R. Ramanujan, and J. Leskovec, “G2sat: Learning to generate sat formulas,” in Advances in neural information processing systems, vol. 32, 2019.
[26] Z. Geng, X. Li, J. Wang, X. Li, Y. Zhang, and F. Wu, “A deep instance generative framework for milp solvers under limited data availability,” arXiv preprint arXiv:2310.02807, 2023.
[27] X. Du, C. Wang, R. Zhong, and J. Yan, "Hubrouter: Learning global routing via hub generation and pin-hub connection," in Advances in Neural Information Processing Systems, 2023.
[28] R. Cheng, X. Lyu, Y. Li, J. Ye, J. Hao, and J. Yan, "The policy-gradient placement and generative routing neural networks for chip design," Advances in Neural Information Processing Systems, vol. 35, pp. 26350-26362, 2022.
[29] J. Sohl-Dickstein, E. Weiss, N. Maheswaranathan, and S. Ganguli, “Deep unsupervised learning using nonequilibrium thermodynamics,” in International Conference on Machine Learning, 2015, pp. 2256–2265.
[30] J. Austin, D. D. Johnson, J. Ho, D. Tarlow, and R. van den Berg, “Structured denoising diffusion models in discrete state-spaces,” Advances in Neural Information Processing Systems, vol. 34, pp. 17981-17993, 2021.
[31] E. Hoogeboom, D. Nielsen, P. Jaini, P. Forre, and M. Welling, "Argmax flows and multinomial diffusion: Learning categorical distributions," Advances in Neural Information Processing Systems, vol. 34, pp. 12454-12465, 2021.
[32] E. Khalil, H. Dai, Y. Zhang, B. Dilkina, and L. Song, "Learning combinatorial optimization algorithms over graphs," Advances in neural information processing systems, vol. 30, 2017.
[33] C. K. Joshi, T. Laurent, and X. Bresson, "An efficient graph convolutional network technique for the travelling salesman problem," arXiv preprint arXiv:1906.01227, 2019.
[34] Z.-H. Fu, K.-B. Qiu, and H. Zha, "Generalize a small pre-trained model to arbitrarily large tsp instances," in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 8, 2021, pp. 7474-7482.
[35] R. Qiu, Z. Sun, and Y. Yang, "Dimes: A differentiable meta solver for combinatorial optimization problems," arXiv preprint arXiv:2210.04123, 2022.
[36] P. R. d O Costa, J. Rhuggenaath, Y. Zhang, and A. Akcay, “Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning,” in Asian Conference on Machine Learning, 2020, pp. 465–480.
[37] Y. Wu, W. Song, Z. Cao, J. Zhang, and A. Lim, "Learning improvement heuristics for solving routing problems," IEEE transactions on neural networks and learning systems, vol. 33, no. 9, pp. 5057-5069, 2021.