[1] Y. Bengio, A. Lodi, and A. Prouvost, "Machine learning for combinatorial optimization: a methodological tour d'horizon," European Journal of Operational Research, 2021.
[2] Q. Cappart, D. Chételat, E. Khalil, A. Lodi, C. Morris, and P. Velicković, "Combinatorial optimization and reasoning with graph neural networks," arXiv preprint arXiv:2102.09544, 2021.
[3] J. Zhang, C. Liu, X. Li, H.-L. Zhen, M. Yuan, Y. Li, and J. Yan, "A survey for solving mixed integer programming via machine learning," Neurocomputing, vol. 519, pp. 205-217, 2023.
[4] W. Guo, H.-L. Zhen, X. Li, W. Luo, M. Yuan, Y. Jin, and J. Yan, "Machine learning methods in solving the boolean satisfiability problem," Machine Intelligence Research, 2023.
[5] X. Chen and Y. Tian, "Learning to perform local rewriting for combinatorial optimization," Advances in Neural Information Processing Systems, vol. 32, 2019.
[6] Y.-D. Kwon, J. Choo, B. Kim, I. Yoon, Y. Gwon, and S. Min, "Pomo: Policy optimization with multiple optima for reinforcement learning," Advances in Neural Information Processing Systems, vol. 33, pp. 21-188-21-198, 2020.
[7] S. Li, Z. Yan, and C. Wu, “Learning to delegate for large-scale vehicle routing,” Advances in Neural Information Processing Systems, vol. 34, pp. 26198-26211, 2021.
[8] M. Kim, J. Park, and J. Park, "Sym-nco: Leveraging symmetry for neural combinatorial optimization," arXiv preprint arXiv:2205.13209, 2022.
[9] Y. Li, Y. Jia, W. Luo, H.-L. Zhen, X. Li, M. Yuan, and J. Yan, "Kissat adaptive restart, kissat cfexp: Adaptive restart policy and variable scoring improvement," Proceedings of SAT Competition, 2022.
[10] O. Vinyals, M. Fortunato, and N. Jaitly, “Pointer networks,” Advances in neural information processing systems, vol. 28, 2015.
[11] R. Wang, J. Yan, and X. Yang, "Neural graph matching network: Learning lawler's quadratic assignment problem with extension to hypergraph and multiple-graph matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, 2022.
[12] W. Kool, H. Van Hoof, and M. Welling, “Attention, learn to solve routing problems!” arXiv preprint arXiv:1803.08475, 2018.
[13] N. Karalias and A. Loukas, "Erdos goes neural: an unsupervised learning framework for combinatorial optimization on graphs," Advances in Neural Information Processing Systems, vol. 33, pp. 6659-6672, 2020.
[14] S. Geisler, J. Sommer, J. Schuchardt, A. Bojchevski, and S. Gunnemann, "Generalization of neural combinatorial solvers through the lens of adversarial robustness," in International Conference on Learning Representations, 2022.
[15] H. Lu, Z. Li, R. Wang, Q. Ren, X. Li, M. Yuan, J. Zeng, X. Yang, and J. Yan, "Roco: A general framework for evaluating robustness of combinatorial optimization solvers on graphs," in The Eleventh International Conference on Learning Representations, 2023.
[16] I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio, “Neural combinatorial optimization with reinforcement learning,” arXiv preprint arXiv:1611.09940, 2016.
[17] A. Hottung, Y.-D. Kwon, and K. Tierney, "Efficient active search for combinatorial optimization problems," arXiv preprint arXiv:2106.05126, 2021.
[18] H. Wang and P. Li, "Unsupervised learning for combinatorial optimization needs meta-learning," arXiv preprint arXiv:2301.03116, 2023.
[19] Z. Sun and Y. Yang, "Difusco: Graph-based diffusion solvers for combinatorial optimization," arXiv preprint arXiv:2302.08224, 2023.