1. Aarts E H L, Korst J H M, van Laarhoven P J M. A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem. J Stat Phys, 1988, 50: 187–206
2. Agarwal C, Queen O, Lakkaraju H, et al. Evaluating explainability for graph neural networks. Scientific Data, 2023, 10: 144
3. Andrade D V, Resende M G C, Werneck R F. Fast local search for the maximum independent set problem. J Heuristics, 2012, 18: 525–547
4. Ansótegui C, Bonet M L, Levy J. Towards industrial-like random sat instances. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence. Freiburg: Inst Inform, 2009, 387–392
5. Barrett T, Clements W, Foerster J, et al. Exploratory combinatorial optimization with reinforcement learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34. Palo Alto: AAAI Press, 2020, 3243–3250