A Novel and Fine-grained Heap Randomization Allocation Strategy for Effectively Alleviating Heap Buffer Overflow Vulnerabilities. - Zhiyong Jin; Yongfu Chen; Tian Liu; Kai Li; Zhenting Wang; Jiongzhi Zheng (ICMAI, 2019)

Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001 (AAAI, 2021)

Farsighted Probabilistic Sampling based Local Search for (Weighted) Partial MaxSAT. - Jiongzhi Zheng; Jianrong Zhou; Kun He 001 (CoRR, 2021)

BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001; Felip Manyà (IJCAI, 2022)

A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem. - Jianrong Zhou; Kun He 001; Jiongzhi Zheng; Chu-Min Li 001; Yanli Liu 001 (IJCAI, 2022)

An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem. - Jiongzhi Zheng; Yawei Hong; Wenchang Xu; Wentao Li; Yongfu Chen (Comput. Oper. Res., 2022)

An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem. - Yuxuan Wang; Jinyao Xie; Jiongzhi Zheng; Kun He 001 (CoRR, 2022)

Incorporating Multi-armed Bandit with Local Search for MaxSAT. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001; Felip Manyà (CoRR, 2022)

Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem. - Jianrong Zhou; Jiongzhi Zheng; Kun He 001 (Int. J. Comput. Intell. Syst., 2022)

Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou (AAAI, 2023)

Relaxed Graph Color Bound for the Maximum k-plex Problem. - Jiongzhi Zheng; Mingming Jin; Yan Jin 005; Kun He 001 (CoRR, 2023)

Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale. - Jianrong Zhou; Kun He 001; Jiongzhi Zheng; Chu-Min Li 001 (CoRR, 2023)

Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001 (Knowl. Based Syst., 2023)

A Simulated Annealing approach for the Circle Bin Packing Problem with Rectangular Items. - Kevin Tole; Rashad Moqa; Jiongzhi Zheng; Kun He 001 (Comput. Ind. Eng., 2023)

A reinforced hybrid genetic algorithm for the traveling salesman problem. - Jiongzhi Zheng; Jialun Zhong; Menglei Chen; Kun He 001 (Comput. Oper. Res., 2023)

KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem. - Mingming Jin; Jiongzhi Zheng; Kun He 001 (AAAI, 2024)

DiverTEAM: An Effective Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems. - Jinghui Xue; Jiongzhi Zheng; Kun He 001; Chu-Min Li 001; Yanli Liu 001 (ECAI, 2024)

Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers. - Jiongzhi Zheng; Zhuo Chen; Chu-Min Li 001; Kun He 001 (IJCAI, 2024)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum s-Bundle Problem. - Jinghui Xue; Jiongzhi Zheng; Mingming Jin; Kun He 001 (CoRR, 2024)

An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems. - Jiongzhi Zheng; Jinghui Xue; Kun He 001; Chu-Min Li 001; Yanli Liu 001 (CoRR, 2024)

FIMP-HGA: A Novel Approach to Addressing the Partitioning Min-Max Weighted Matching Problem. - Yuxuan Wang; Jiongzhi Zheng; Jinyao Xie; Kun He 001 (CoRR, 2024)

Geometric batch optimization for packing equal circles in a circle on large scale. - Jianrong Zhou; Kun He 001; Jiongzhi Zheng; Chu-Min Li 001 (Expert Syst. Appl., 2024)

Integrating multi-armed bandit with local search for MaxSAT. - Jiongzhi Zheng; Kun He 001; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001; Felip Manyà (Artif. Intell., 2025)

Online and offline packing cylinders in a cylindrical container. - Rashad Moqa; Jiongzhi Zheng; Kun He 001 (Discret. Appl. Math., 2025)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems. - Long Wang; Jiongzhi Zheng; Zhengda Xiong; Kun He 001 (CoRR, 2025)

Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problems. - Long Wanga; Jiongzhi Zheng; Zhengda Xiong; Chumin Li 001; Kun He 001 (CoRR, 2025)