| Combining reinforcement learning with Lin-Kernighan-Helsgaun algorithm for the traveling salesman problem J Zheng, K He, J Zhou, Y Jin, CM Li Proceedings of the AAAI conference on artificial intelligence 35 (14), 12445 …, 2021 | 69 | 2021 |
| Reinforced Lin–Kernighan–Helsgaun algorithms for the traveling salesman problems J Zheng, K He, J Zhou, Y Jin, CM Li Knowledge-Based Systems 260, 110144, 2023 | 30 | 2023 |
| An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem J Zheng, Y Hong, W Xu, W Li, Y Chen Computers & Operations Research 143, 105772, 2022 | 27 | 2022 |
| A reinforced hybrid genetic algorithm for the traveling salesman problem J Zheng, J Zhong, M Chen, K He Computers & Operations Research 157, 106249, 2023 | 24 | 2023 |
| BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit J Zheng, K He, J Zhou, Y Jin, C Li, F Manya Proceedings of the International Joint Conference on Artificial Intelligence …, 2022 | 21 | 2022 |
| A simulated annealing approach for the circle bin packing problem with rectangular items K Tole, R Moqa, J Zheng, K He Computers & Industrial Engineering 176, 109004, 2023 | 15 | 2023 |
| Farsighted probabilistic sampling based local search for (weighted) partial maxsat J Zheng, J Zhou, K He arXiv preprint arXiv:2108.09988, 2021 | 12 | 2021 |
| Relaxed graph color bound for the maximum k-plex problem J Zheng, M Jin, Y Jin, K He arXiv preprint arXiv:2301.07300, 2023 | 8 | 2023 |
| Combining hybrid walking strategy with kissat mab, cadical, and lstech-maple J Zheng, K He, Z Chen, J Zhou, CM Li SAT COMPETITION 2022, 20, 2022 | 8 | 2022 |
| A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem J Zhou, K He, J Zheng, CM Li, Y Liu Proceedings of the International Joint Conference on Artificial Intelligence …, 2022 | 7 | 2022 |
| Composite clustering normal distribution transform algorithm T Liu, J Zheng, Z Wang, Z Huang, Y Chen International Journal of Advanced Robotic Systems 17 (3), 1729881420912142, 2020 | 6 | 2020 |
| Effective variable depth local search for the budgeted maximum coverage problem J Zhou, J Zheng, K He International Journal of Computational Intelligence Systems 15 (1), 43, 2022 | 4 | 2022 |
| A novel and fine-grained heap randomization allocation strategy for effectively alleviating heap buffer overflow vulnerabilities Z Jin, Y Chen, T Liu, K Li, Z Wang, J Zheng Proceedings of the 2019 4th International Conference on Mathematics and …, 2019 | 4 | 2019 |
| Decision tree based hybrid walking strategies J Zheng, K He, Z Chen, J Zhou, CM Li MaxSAT Evaluation 2022, 24, 2022 | 3 | 2022 |
| Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers J Zheng, Z Chen, CM Li, K He arXiv preprint arXiv:2401.10589, 2024 | 2 | 2024 |
| Farsighted probabilistic sampling: a general strategy for boosting local search MaxSAT solvers J Zheng, K He, J Zhou Proceedings of the AAAI Conference on Artificial Intelligence 37 (4), 4132-4139, 2023 | 2 | 2023 |
| Geometric batch optimization for packing equal circles in a circle on large scale J Zhou, K He, J Zheng, CM Li Expert Systems with Applications 250, 123952, 2024 | 1 | 2024 |
| KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem M Jin, J Zheng, K He Proceedings of the AAAI Conference on Artificial Intelligence 38 (18), 20735 …, 2024 | 1 | 2024 |
| Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale J Zhou, K He, J Zheng, CM Li arXiv preprint arXiv:2303.02650, 2023 | 1 | 2023 |
| Two New Upper Bounds for the Maximum k-plex Problem J Zheng, M Jin, K He arXiv preprint arXiv:2301.07300, 2023 | 1 | 2023 |
Kun HeProfessor, Huazhong University of Science and TechnologyVerified email at hust.edu.cn
