Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT. - Zhendong Lei; Shaowei Cai 001 (IJCAI, 2018)

Solving Set Cover and Dominating Set via Maximum Satisfiability. - Zhendong Lei; Shaowei Cai 001 (AAAI, 2020)

Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints. - Zhendong Lei; Shaowei Cai 001; Chuan Luo 002 (IJCAI, 2020)

Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability. - Shaowei Cai 001; Zhendong Lei (Artif. Intell., 2020)

NuDist: An Efficient Local Search Algorithm for (Weighted) Partial MaxSAT. - Zhendong Lei; Shaowei Cai 001 (Comput. J., 2020)

WCA: A weighting local search for constrained combinatorial test optimization. - Yingjie Fu; Zhendong Lei; Shaowei Cai 001; Jinkun Lin; Haoran Wang (Inf. Softw. Technol., 2020)

Efficient Local Search for Pseudo Boolean Optimization. - Zhendong Lei; Shaowei Cai 001; Chuan Luo 002; Holger H. Hoos (SAT, 2021)

Towards More Efficient Local Search for Pseudo-Boolean Optimization. - Yi Chu; Shaowei Cai 001; Chuan Luo 002; Zhendong Lei; Cong Peng 004 (CP, 2023)

Deep Cooperation of Local Search and Unit Propagation Techniques. - Xiamin Chen; Zhendong Lei; Pinyan Lu (CP, 2024)

Optimizing local search-based partial MaxSAT solving via initial assignment prediction. - Chanjuan Liu; Guangyuan Liu; Chuan Luo 002; Shaowei Cai 001; Zhendong Lei; Wenjie Zhang 007; Yi Chu; Guojing Zhang (Sci. China Inf. Sci., 2025)