Breaking Cycle Structure to Improve Lower Bound for Max-SAT. - Yanli Liu 001; Chumin Li 001; Kun He 001; Yi Fan (FAW, 2016)

A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem. - Hua Jiang; Chu-Min Li 001; Yanli Liu 001; Felip Manyà (AAAI, 2018)

A new upper bound for the maximum weight clique problem. - Chu-Min Li 001; Yanli Liu 001; Hua Jiang; Felip Manyà; Yu Li 012 (Eur. J. Oper. Res., 2018)

A Learning based Branch and Bound for Maximum Common Subgraph Problems. - Yanli Liu 001; Chu-Min Li 001; Hua Jiang; Kun He 001 (CoRR, 2019)

A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems. - Yanli Liu 001; Chu-Min Li 001; Hua Jiang; Kun He 001 (AAAI, 2020)

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)

Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem. - Yanli Liu 001; Jiming Zhao; Chu-Min Li 001; Hua Jiang; Kun He 001 (CoRR, 2022)

Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem. - Yanli Liu 001; Jiming Zhao; Chu-Min Li 001; Hua Jiang; Kun He 001 (AAAI, 2023)

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)

An efficient solution space exploring and descent method for packing equal spheres in a sphere. - Jianrong Zhou; Shuo Ren; Kun He 001; Yanli Liu 001; Chu-Min Li 001 (Comput. Oper. Res., 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)

Enhancing cooperative evolution in spatial public goods game by particle swarm optimization based on exploration and q-learning. - Xianjia Wang; Zhipeng Yang; Guici Chen; Yanli Liu 001 (Appl. Math. Comput., 2024)