Chu Min Li
Orcid: 0000-0002-6886-8434Affiliations:
- University of Picardie Jules Verne, Amiens, France
According to our database1,
Chu Min Li
authored at least 139 papers
between 1992 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
2024
Expert Syst. Appl., 2024
An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems.
CoRR, 2024
An efficient solution space exploring and descent method for packing equal spheres in a sphere.
Comput. Oper. Res., 2024
Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing, 2024
Proceedings of the 54th IEEE International Symposium on Multiple-Valued Logic, 2024
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024
DiverTEAM: An Effective Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024
Minimizing Working-Group Conflicts in Conference Session Scheduling Through Maximum Satisfiability (Short Paper).
Proceedings of the 30th International Conference on Principles and Practice of Constraint Programming, 2024
Proceedings of the Artificial Intelligence Research and Development, 2024
Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
A vertex weighting-based double-tabu search algorithm for the classical p-center problem.
Comput. Oper. Res., December, 2023
Int. J. Approx. Reason., November, 2023
J. Comput. Sci. Technol., September, 2023
Comput. Oper. Res., May, 2023
Knowl. Based Syst., 2023
Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale.
CoRR, 2023
Proceedings of the 53rd IEEE International Symposium on Multiple-Valued Logic, 2023
A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
Proceedings of the Artificial Intelligence Research and Development, 2023
Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
IEEE Trans. Computers, 2022
Int. J. Softw. Informatics, 2022
CoRR, 2022
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
HEA-D: A Hybrid Evolutionary Algorithm for Diversified Top-k Weight Clique Search Problem.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
Proceedings of the Artificial Intelligence Research and Development, 2022
Proceedings of the Logic of Software. A Tasting Menu of Formal Methods, 2022
2021
Proceedings of the Handbook of Satisfiability - Second Edition, 2021
Solving longest common subsequence problems via a transformation to the maximum clique problem.
Comput. Oper. Res., 2021
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021
Proceedings of the Artificial Intelligence Research and Development, 2021
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
CoRR, 2020
Comput. Oper. Res., 2020
IEEE Access, 2020
Proceedings of the 50th IEEE International Symposium on Multiple-Valued Logic, 2020
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020
Weighting-based parallel local search for optimal camera placement and unicost set covering.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020
2019
An Effective Variable Neighborhood Search with Perturbation for Location-Routing Problem.
Int. J. Artif. Intell. Tools, 2019
CoRR, 2019
An iterative Path-Breaking approach with mutation and restart strategies for the MAX-SAT problem.
Comput. Oper. Res., 2019
Sci. China Inf. Sci., 2019
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019
Proceedings of the 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL), 2019
A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019
2018
GMDS-ZNN Variants Having Errors Proportional to Sampling Gap as Compared with Models 1 and 2 Having Higher Precision.
Proceedings of the 5th International Conference on Systems and Informatics, 2018
Proceedings of the Artificial Intelligence Research and Development, 2018
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018
2017
Discret. Appl. Math., 2017
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem.
Comput. Oper. Res., 2017
An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules.
Comput. Oper. Res., 2017
Proceedings of the 47th IEEE International Symposium on Multiple-Valued Logic, 2017
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017
2016
J. Artif. Intell. Res., 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016
Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016
Proceedings of the Artificial Intelligence Research and Development, 2016
2015
Eur. J. Oper. Res., 2015
Incremental MaxSAT Reasoning to Reduce Branches in a Branch-and-Bound Algorithm for MaxClique.
Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
2014
CoRR, 2014
Comput. Oper. Res., 2014
Proceedings of the IEEE 44th International Symposium on Multiple-Valued Logic, 2014
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014
2013
Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem.
Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013
Proceedings of the Principles and Practice of Constraint Programming, 2013
2012
Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012
Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012
Proceedings of the Principles and Practice of Constraint Programming, 2012
Proceedings of the Artificial Intelligence Research and Development, 2012
Proceedings of the Artificial Intelligence Research and Development, 2012
2011
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011
Proceedings of the Artificial Intelligence Research and Development, 2011
2010
Proceedings of the Theory and Applications of Satisfiability Testing, 2010
Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem.
Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010
2009
Proceedings of the Handbook of Satisfiability, 2009
Proceedings of the Theory and Applications of Satisfiability Testing, 2009
2008
A Switching Criterion for Intensification and Diversification in Local Search for SAT.
J. Satisf. Boolean Model. Comput., 2008
Proceedings of the Theory and Applications of Satisfiability Testing, 2008
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2008
Proceedings of the Principles and Practice of Constraint Programming, 2008
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008
2007
Ann. Math. Artif. Intell., 2007
Proceedings of the Theory and Applications of Satisfiability Testing, 2007
Proceedings of the Principles and Practice of Constraint Programming, 2007
2006
Comput. Oper. Res., 2006
Proceedings of the 4th International Confernce on Computer Sciences: Research, 2006
Proceedings of the 36th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2006), 2006
Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006
Proceedings of the Proceedings, 2006
2005
J. Oper. Res. Soc., 2005
J. Autom. Reason., 2005
Proceedings of the Theory and Applications of Satisfiability Testing, 2005
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers.
Proceedings of the Principles and Practice of Constraint Programming, 2005
2003
Discret. Appl. Math., 2003
Proceedings of the Principles and Practice of Constraint Programming, 2003
2002
Proceedings of the Principles and Practice of Constraint Programming, 2002
Proceedings of the Principles and Practice of Constraint Programming, 2002
2001
Electron. Notes Discret. Math., 2001
2000
Inf. Process. Lett., 2000
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000
1999
Inf. Process. Lett., 1999
1997
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997
1995
U-Log = datalog + constraints.
Proceedings of the JFPLC'95, 1995
1992
On Boolean Feature Types.
Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992
Proceedings of the Programming Language Implementation and Logic Programming, 1992
Realizing an efficient and incremental access to an object oriented database with Prolog.
Proceedings of the JFPL'92, 1992
Applying a unified object logic model to implement a strong and dynamic interface between Prolog and an OODBMS.
Proceedings of the VIIIèmes Journées Bases de Données Avancées, 1992