| 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 | | 2024 |
| FIMP-HGA: A Novel Approach to Addressing the Partitioning Min-Max Weighted Matching Problem Y Wang, J Zheng, J Xie, K He arXiv preprint arXiv:2405.03176, 2024 | | 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 | | 2024 |
| An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum -Bundle Problem J Xue, J Zheng, M Jin, K He arXiv preprint arXiv:2402.03736, 2024 | | 2024 |
| An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems J Zheng, J Xue, K He, CM Li, Y Liu arXiv preprint arXiv:2404.09997, 2024 | | 2024 |
| 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 | | 2024 |
| A reinforced hybrid genetic algorithm for the traveling salesman problem J Zheng, J Zhong, M Chen, K He Computers & Operations Research 157, 106249, 2023 | 18 | 2023 |
| 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 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 |
| 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 | 12 | 2023 |
| 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 | 23 | 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 |
| Efficient Approaches for the Single Cylindrical Packing Problem with Cylindrical Items R Moqa, J Zheng, K He Available at SSRN 4401347, 2023 | | 2023 |
| Relaxed graph color bound for the maximum k-plex problem J Zheng, M Jin, Y Jin, K He arXiv preprint arXiv:2301.07300, 2023 | 4 | 2023 |
| Incorporating Multi-armed Bandit with Local Search for MaxSAT J Zheng, K He, J Zhou, Y Jin, CM Li, F Manyà arXiv preprint arXiv:2211.16011, 2022 | 1 | 2022 |
| 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 |
| 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 | 24 | 2022 |
| An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem Y Wang, J Xie, J Zheng, K He arXiv preprint arXiv:2201.10049, 2022 | | 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 | 6 | 2022 |
| 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 | 17 | 2022 |
Kun HeProfessor, Huazhong University of Science and Technology在 hust.edu.cn 的电子邮件经过验证
