Chu-Min Li

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 56

Top Topics

Clause Learning

Traveling Salesman

Branch And Bound

Top Venues

Comput. Oper. Res.

Publications

Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li
Geometric batch optimization for packing equal circles in a circle on large scale. Expert Syst. Appl. 250 (2024)
Yi Chu, Chu-Min Li, Furong Ye, Shaowei Cai
Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme. SAT (2024)
Mohamed Sami Cherif, Heythem Sattoutah, Chu-Min Li, Corinne Lucet, Laure Brisoux Devendeville
Minimizing Working-Group Conflicts in Conference Session Scheduling Through Maximum Satisfiability (Short Paper). CP (2024)
Jiongzhi Zheng, Zhuo Chen, Chu-Min Li, Kun He
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers. CoRR (2024)
Jiongzhi Zheng, Jinghui Xue, Kun He, Chu-Min Li, Yanli Liu
An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems. CoRR (2024)
Qingyun Zhang, Yuming Du, Zhouxing Su, Chu-Min Li, Junzhou Xu, Zhihuai Chen, Zhipeng Lü
Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem. AAAI (2024)
Jianrong Zhou, Shuo Ren, Kun He, Yanli Liu, Chu-Min Li
An efficient solution space exploring and descent method for packing equal spheres in a sphere. Comput. Oper. Res. 164 (2024)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li
Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems. Knowl. Based Syst. 260 (2023)
Shuolin Li, Chu-Min Li, Mao Luo, Jordi Coll, Djamal Habet, Felip Manyà
A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers. IJCAI (2023)
Jun Wu, Chu-Min Li, Luzhi Wang, Shuli Hu, Peng Zhao, Minghao Yin
On solving simplified diversified top-k s-plex problem. Comput. Oper. Res. 153 (2023)
Jianrong Zhou, Shuo Ren, Kun He, Yanli Liu, Chu-Min Li
An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere. CoRR (2023)
Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li
Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale. CoRR (2023)
Hua Jiang, Ke Bai, Hai-Jiao Liu, Chu-Min Li, Felip Manyà, Zhang-Hua Fu
Parallel Bounded Search for the Maximum Clique Problem. J. Comput. Sci. Technol. 38 (5) (2023)
Jordi Coll, Chu-Min Li, Felip Manyà, Elifnaz Yangin
A Complete Tableau Calculus for the Regular MaxSAT Problem. CCIA (2023)
Yanli Liu, Jiming Zhao, Chu-Min Li, Hua Jiang, Kun He
Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem. AAAI (2023)
Jordi Coll, Chu-Min Li, Felip Manyà, Elifnaz Yangin
MaxSAT resolution for regular propositional logic. Int. J. Approx. Reason. 162 (2023)
Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li, Yanli Liu
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem. CoRR (2022)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà
Incorporating Multi-armed Bandit with Local Search for MaxSAT. CoRR (2022)
Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li, Yanli Liu
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem. IJCAI (2022)
Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He
Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract). IJCAI (2022)
Yanli Liu, Jiming Zhao, Chu-Min Li, Hua Jiang, Kun He
Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem. CoRR (2022)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li
Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems. CoRR (2022)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. IJCAI (2022)
Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He
Boosting branch-and-bound MaxSAT solvers with clause learning. AI Commun. 35 (2) (2022)
Yan Jin, Bowen Xiong, Kun He, Jin-Kao Hao, Chu-Min Li, Zhang-Hua Fu
Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization. IEEE Trans. Computers 71 (10) (2022)
Shoulin Li, Jordi Coll, Djamal Habet, Chu-Min Li, Felip Manyà
A Tableau Calculus for MaxSAT Based on Resolution. CCIA (2022)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem. AAAI (2021)
Mao Luo, Chu-Min Li, Xinyun Wu, Shuolin Li, Zhipeng Lü
Branching Strategy Selection Approach Based on Vivification Ratio. CoRR (2021)
Chu-Min Li, Fan Xiao, Felip Manyà
A resolution calculus for MinSAT. Log. J. IGPL 29 (1) (2021)
Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He
Combining Clause Learning and Branch and Bound for MaxSAT. CP (2021)
Chu-Min Li, Felip Manyà, Joan Ramon Soler, Amanda Vidal
From Non-Clausal to Clausal MinSAT. CCIA (2021)
Zhouxing Su, Qingyun Zhang, Zhipeng Lü, Chu-Min Li, Weibo Lin, Fuda Ma
Weighting-based Variable Neighborhood Search for Optimal Camera Placement. AAAI (2021)
Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl
Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput. Oper. Res. 125 (2021)
Yanli Liu, Chu-Min Li, Hua Jiang, Kun He
A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems. AAAI (2020)
Jun Wu, Chu-Min Li, Lu Jiang, Junping Zhou, Minghao Yin
clique search problem. Comput. Oper. Res. 116 (2020)
Chu-Min Li, Fan Xiao, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li
Clause vivification by unit propagation in CDCL SAT solvers. Artif. Intell. 279 (2020)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem. CoRR (2020)
Kun He, Min Zhang, Jianrong Zhou, Yan Jin, Chu-Min Li
Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem. CoRR (2020)
Zhen-Xing Xu, Kun He, Chu-Min Li
An iterative Path-Breaking approach with mutation and restart strategies for the MAX-SAT problem. Comput. Oper. Res. 104 (2019)
Luzhi Wang, Chu-Min Li, Junping Zhou, Bo Jin, Minghao Yin
An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs. CoRR (2019)
Fan Xiao, Chu-Min Li, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li
A branching heuristic for SAT solvers based on complete implication graphs. Sci. China Inf. Sci. 62 (7) (2019)
Hua Jiang, Corinne Lucet, Laure Devendeville, Chu-Min Li
An Effective Variable Neighborhood Search with Perturbation for Location-Routing Problem. Int. J. Artif. Intell. Tools 28 (7) (2019)
Junwen Ding, Zhipeng Lü, Chu-Min Li, Liji Shen, Liping Xu, Fred W. Glover
A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem. AAAI (2019)
Yanli Liu, Chu-Min Li, Hua Jiang, Kun He
A Learning based Branch and Bound for Maximum Common Subgraph Problems. CoRR (2019)
Chu-Min Li, Zhiwen Fang, Hua Jiang, Ke Xu
Incremental Upper Bound for the Maximum Clique Problem. INFORMS J. Comput. 30 (1) (2018)
Zhen-Xing Xu, Kun He, Chu-Min Li
An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem. CoRR (2018)
Chu-Min Li, Fan Xiao, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li
Clause Vivification by Unit Propagation in CDCL SAT Solvers. CoRR (2018)
Hua Jiang, Chu-Min Li, Yanli Liu, Felip Manyà
A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem. AAAI (2018)
Chu-Min Li, Yanli Liu, Hua Jiang, Felip Manyà, Yu Li
A new upper bound for the maximum weight clique problem. Eur. J. Oper. Res. 270 (1) (2018)
Hua Jiang, Chu-Min Li, Felip Manyà
An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs. AAAI (2017)
Clément Lecat, Corinne Lucet, Chu-Min Li
New Lower Bound for the Minimum Sum Coloring Problem. AAAI (2017)
Mao Luo, Chu-Min Li, Fan Xiao, Felip Manyà, Zhipeng Lü
An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers. IJCAI (2017)
Clément Lecat, Corinne Lucet, Chu-Min Li
Minimum sum coloring problem: Upper bounds for the chromatic strength. Discret. Appl. Math. 233 (2017)
Chu-Min Li, Hua Jiang, Felip Manyà
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Comput. Oper. Res. 84 (2017)
Zhiwen Fang, Chu-Min Li, Ke Xu
An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem. J. Artif. Intell. Res. 55 (2016)
Clément Lecat, Corinne Lucet, Chu-Min Li
Sum Coloring : New upper bounds for the chromatic strength. CoRR (2016)
Chu-Min Li, Hua Jiang, Ruchu Xu
Incremental MaxSAT Reasoning to Reduce Branches in a Branch-and-Bound Algorithm for MaxClique. LION (2015)
Zhiwen Fang, Chu-Min Li, Kan Qiao, Xu Feng, Ke Xu
Solving Maximum Weight Clique Using Maximum Satisfiability Reasoning. ECAI (2014)
Chu-Min Li, Zhiwen Fang, Ke Xu
Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem. ICTAI (2013)