Applying a unified object logic model to implement a strong and dynamic interface between Prolog and an OODBMS. - Chu Min Li 001; Paul Y. Gloess (BDA, 1992)

Realizing an efficient and incremental access to an object oriented database with Prolog. - Chu Min Li 001; Paul Y. Gloess (JFPL, 1992)

ProQuery: Logical Access to an OODB. - Chu Min Li 001; Paul Y. Gloess (PLILP, 1992)

On Boolean Feature Types. - Paul Y. Gloess; Yan-Nong Huang; Chumin Li 001; Miguel-Angel Oros (WSA, 1992)

U-Log = datalog + constraints. - Paul Y. Gloess; Miguel-Angel Oros; Chu Min Li 001 (JFPLC, 1995)

Look-Ahead Versus Look-Back for Satisfiability Problems. - Chu Min Li 001; Anbulagan (CP, 1997)

Heuristics Based on Unit Propagation for Satisfiability Problems. - Chu Min Li 001; Anbulagan (IJCAI (1), 1997)

A Constraint-Based Approach to Narrow Search Trees for Satisfiability. - Chu Min Li 001 (Inf. Process. Lett., 1999)

Integrating Equivalency Reasoning into Davis-Putnam Procedure. - Chu Min Li 001 (AAAI/IAAI, 2000)

Equivalency reasoning to solve a class of hard SAT problems. - Chu Min Li 001 (Inf. Process. Lett., 2000)

Parallelizing Satz Using Dynamic Workload Balancing. - Bernard Jurkowiak; Chu Min Li 001; Gil Utard (Electron. Notes Discret. Math., 2001)

Characterizing SAT Problems with the Row Convexity Property. - Hachemi Bennaceur; Chu Min Li 001 (CP, 2002)

A Hybrid Approach for SAT. - Djamal Habet; Chu Min Li 001; Laure Devendeville; Michel Vasquez (CP, 2002)

A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container. - Wen Qi Huang 001; Yu Li 012; Bernard Jurkowiak; Chu Min Li 001; Ru Chu Xu (CP, 2003)

Equivalent literal propagation in the DLL procedure. - Chu Min Li 001 (Discret. Appl. Math., 2003)

On the limit of branching rules for hard random unsatisfiable 3-SAT. - Chu Min Li 001; Sylvain Gérard (Discret. Appl. Math., 2003)

Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. - Chu Min Li 001; Felip Manyà; Jordi Planes (CP, 2005)

Diversification and Determinism in Local Search for Satisfiability. - Chu Min Li 001; Wen Qi Huang 001 (SAT, 2005)

A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers. - Bernard Jurkowiak; Chu Min Li 001; Gil Utard (J. Autom. Reason., 2005)

Greedy algorithms for packing unequal circles into a rectangular container. - Wen Qi Huang 001; Yu Li 012; Hakim Akeb; Chu Min Li 001 (J. Oper. Res. Soc., 2005)

Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. - Chu Min Li 001; Felip Manyà; Jordi Planes (AAAI, 2006)

An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks. - Abdellah Idrissi; Chu Min Li 001; Jean Frédéric Myoupo (ICTAI, 2006)

Towards Solving Many-Valued MaxSAT. - Josep Argelich; Xavier Domingo; Chu Min Li 001; Felip Manyà; Jordi Planes (ISMVL, 2006)

Modeling and optimization of the capacity allocation problem with constraints. - Abdellah Idrissi; Chu Min Li 001 (RIVF, 2006)

New heuristics for packing unequal circles into a circular container. - Wen Qi Huang 001; Yu Li 012; Chu Min Li 001; Ru Chu Xu (Comput. Oper. Res., 2006)

On Inconsistent Clause-Subsets for Max-SAT Solving. - Sylvain Darras; Gilles Dequen; Laure Devendeville; Chu Min Li 001 (CP, 2007)

Combining Adaptive Noise and Look-Ahead in Local Search for SAT. - Chu Min Li 001; Wanxia Wei; Harry Zhang (SAT, 2007)

Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. - Carlos Ansótegui; Jose Larrubia; Chu Min Li 001; Felip Manyà (Ann. Math. Artif. Intell., 2007)

New Inference Rules for Max-SAT. - Chu Min Li 001; Felip Manyà; Jordi Planes (J. Artif. Intell. Res., 2007)

Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving. - Han Lin; Kaile Su; Chu Min Li 001 (AAAI, 2008)

Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. - Chu Min Li 001; Felip Manyà; Nouredine Ould Mohamedou; Jordi Planes (CP, 2008)

Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT. - Wanxia Wei; Chu Min Li 001; Harry Zhang (CP, 2008)

A Preprocessor for Max-SAT Solvers. - Josep Argelich; Chu Min Li 001; Felip Manyà (SAT, 2008)

The First and Second Max-SAT Evaluations. - Josep Argelich; Chu Min Li 001; Felip Manyà; Jordi Planes (J. Satisf. Boolean Model. Comput., 2008)

Guest Editors Conclusion. - Ewald Speckenmeyer; Armando Tacchella; Vasco Manquinho; Chu Min Li 001 (J. Satisf. Boolean Model. Comput., 2008)

A Switching Criterion for Intensification and Diversification in Local Search for SAT. - Wanxia Wei; Chu Min Li 001; Harry Zhang (J. Satisf. Boolean Model. Comput., 2008)

Exploiting Cycle Structures in Max-SAT. - Chu Min Li 001; Felip Manyà; Nouredine Ould Mohamedou; Jordi Planes (SAT, 2009)

MaxSAT, Hard and Soft Constraints. - Chu Min Li 001; Felip Manyà (Handbook of Satisfiability, 2009)

An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem. - Chu Min Li 001; Zhe Quan (AAAI, 2010)

Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem. - Chu Min Li 001; Zhe Quan (ICTAI (1), 2010)

Exact MinSAT Solving. - Chu Min Li 001; Felip Manyà; Zhe Quan; Zhu Zhu (SAT, 2010)

Resolution-based lower bounds in MaxSAT. - Chu Min Li 001; Felip Manyà; Nouredine Ould Mohamedou; Jordi Planes (Constraints An Int. J., 2010)

Experimenting with the Instances of the MaxSAT Evaluation. - Josep Argelich; Chu Min Li 001; Felip Manyà; Jordi Planes (CCIA, 2011)

Minimum Satisfiability and Its Applications. - Chu Min Li 001; Zhu Zhu; Felip Manyà; Laurent Simon 001 (IJCAI, 2011)

Analyzing the Instances of the MaxSAT Evaluation. - Josep Argelich; Chu Min Li 001; Felip Manyà; Jordi Planes (SAT, 2011)

Analysis and Generation of Pseudo-Industrial MaxSAT Instances. - Carlos Ansótegui; Maria Luisa Bonet; Jordi Levy; Chu Min Li 001 (CCIA, 2012)

A SAT-Based Approach to MinSAT. - Carlos Ansótegui; Chu Min Li 001; Felip Manyà; Zhu Zhu (CCIA, 2012)

A New Encoding from MinSAT into MaxSAT. - Zhu Zhu; Chu Min Li 001; Felip Manyà; Josep Argelich (CP, 2012)

Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation). - Chu Min Li 001; Yu Li 012 (SAT, 2012)

Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability - (Poster Presentation). - Chu Min Li 001; Wanxia Wei; Yu Li 012 (SAT, 2012)

Optimizing with minimum satisfiability. - Chu Min Li 001; Zhu Zhu; Felip Manyà; Laurent Simon 001 (Artif. Intell., 2012)

MinSAT versus MaxSAT for Optimization Problems. - Josep Argelich; Chu Min Li 001; Felip Manyà; Zhu Zhu (CP, 2013)

Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem. - Chu-Min Li 001; Zhiwen Fang; Ke Xu 001 (ICTAI, 2013)

Solving Maximum Weight Clique Using Maximum Satisfiability Reasoning. - Zhiwen Fang; Chu-Min Li 001; Kan Qiao; Xu Feng; Ke Xu 001 (ECAI, 2014)

Many-Valued MinSAT Solving. - Josep Argelich; Chu Min Li 001; Felip Manyà; Zhu Zhu (ISMVL, 2014)

An exact algorithm with learning for the graph coloring problem. - Zhaoyang Zhou; Chu Min Li 001; Chong Huang 002; Ruchu Xu (Comput. Oper. Res., 2014)

An iterative merging placement algorithm for the fixed-outline floorplanning. - Kun He 001; Pengli Ji; Chumin Li 001 (CoRR, 2014)

An Exact Inference Scheme for MinSAT. - Chu Min Li 001; Felip Manyà (IJCAI, 2015)

Incremental MaxSAT Reasoning to Reduce Branches in a Branch-and-Bound Algorithm for MaxClique. - Chu-Min Li 001; Hua Jiang; Ruchu Xu (LION, 2015)

On Reducing Clause DataBase in Glucose. - Chu Min Li 001; Fan Xiao; Ruchu Xu (IWIL@LPAR, 2015)

Dynamic reduction heuristics for the rectangle packing area minimization problem. - Kun He 001; Pengli Ji; Chumin Li 001 (Eur. J. Oper. Res., 2015)

A Clause Tableau Calculus for MinSAT. - Chu Min Li 001; Felip Manyà; Joan Ramon Soler (CCIA, 2016)

Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs. - Hua Jiang; Chu Min Li 001; Felip Manyà (ECAI, 2016)

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

A Clause Tableau Calculus for MaxSAT. - Chu Min Li 001; Felip Manyà; Joan Ramon Soler (IJCAI, 2016)

Sum Coloring : New upper bounds for the chromatic strength. - Clément Lecat; Corinne Lucet; Chu-Min Li 001 (CoRR, 2016)

An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem. - Zhiwen Fang; Chu-Min Li 001; Ke Xu 001 (J. Artif. Intell. Res., 2016)

An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs. - Hua Jiang; Chu-Min Li 001; Felip Manyà (AAAI, 2017)

New Lower Bound for the Minimum Sum Coloring Problem. - Clément Lecat; Corinne Lucet; Chu-Min Li 001 (AAAI, 2017)

An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers. - Mao Luo; Chu-Min Li 001; Fan Xiao; Felip Manyà; Zhipeng Lü (IJCAI, 2017)

Exploiting Many-Valued Variables in MaxSAT. - Josep Argelich; Chu Min Li 001; Felip Manyà (ISMVL, 2017)

An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules. - Pengli Ji; Kun He 001; Yan Jin 005; Hongsheng Lan; Chumin Li 001 (Comput. Oper. Res., 2017)

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. - Chu-Min Li 001; Hua Jiang; Felip Manyà (Comput. Oper. Res., 2017)

Minimum sum coloring problem: Upper bounds for the chromatic strength. - Clément Lecat; Corinne Lucet; Chu-Min Li 001 (Discret. Appl. Math., 2017)

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)

Clause Branching in MaxSAT and MinSAT. - Josep Argelich; Chu Min Li 001; Felip Manyà; Joan Ramon Soler (CCIA, 2018)

GMDS-ZNN Variants Having Errors Proportional to Sampling Gap as Compared with Models 1 and 2 Having Higher Precision. - Jian Li 018; Guofu Wu; Chumin Li 001; Mengling Xiao; Yunong Zhang (ICSAI, 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)

Incremental Upper Bound for the Maximum Clique Problem. - Chu-Min Li 001; Zhiwen Fang; Hua Jiang; Ke Xu 001 (INFORMS J. Comput., 2018)

A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem. - Junwen Ding; Zhipeng Lü; Chu-Min Li 001; Liji Shen; Liping Xu; Fred W. Glover (AAAI, 2019)

Clausal Form Transformation in MaxSAT. - Chu Min Li 001; Felip Manyà; Joan Ramon Soler (ISMVL, 2019)

A Tableau Calculus for Non-clausal Maximum Satisfiability. - Chu Min Li 001; Felip Manyà; Joan Ramon Soler (TABLEAUX, 2019)

A branching heuristic for SAT solvers based on complete implication graphs. - Fan Xiao; Chu-Min Li 001; Mao Luo; Felip Manyà; Zhipeng Lü; Yu Li 012 (Sci. China Inf. Sci., 2019)

An iterative Path-Breaking approach with mutation and restart strategies for the MAX-SAT problem. - Zhenxing Xu; Kun He 001; Chu-Min Li 001 (Comput. Oper. Res., 2019)

An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs. - Luzhi Wang; Chu-Min Li 001; Junping Zhou; Bo Jin 001; Minghao Yin (CoRR, 2019)

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)

An Effective Variable Neighborhood Search with Perturbation for Location-Routing Problem. - Hua Jiang; Corinne Lucet; Laure Devendeville; Chu-Min Li 001 (Int. J. Artif. Intell. Tools, 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)

Weighting-based parallel local search for optimal camera placement and unicost set covering. - Weibo Lin; Fuda Ma; Zhouxing Su; Qingyun Zhang; Chumin Li 001; Zhipeng Lü (GECCO Companion, 2020)

Vertex Weighting-Based Tabu Search for p-Center Problem. - Qingyun Zhang; Zhipeng Lü; Zhouxing Su; Chumin Li 001; Yuan Fang; Fuda Ma (IJCAI, 2020)

Tableaux for Maximum Satisfiability in Łukasiewicz Logic. - Chu Min Li 001; Felip Manyà; Amanda Vidal (ISMVL, 2020)

Effective Approaches to Solve P-Center Problem via Set Covering and SAT. - Xiaolu Liu; Yuan Fang; Jiaming Chen; Zhouxing Su; Chumin Li 001; Zhipeng Lü (IEEE Access, 2020)

Clause vivification by unit propagation in CDCL SAT solvers. - Chu-Min Li 001; Fan Xiao; Mao Luo; Felip Manyà; Zhipeng Lü; Yu Li 012 (Artif. Intell., 2020)

Local search for diversified Top-k clique search problem. - Jun Wu 020; Chu-Min Li 001; Lu Jiang 007; Junping Zhou; Minghao Yin (Comput. Oper. Res., 2020)

Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem. - Kun He 001; Min Zhang; Jianrong Zhou; Yan Jin 005; Chu-Min Li 001 (CoRR, 2020)

Weighting-based Variable Neighborhood Search for Optimal Camera Placement. - Zhouxing Su; Qingyun Zhang; Zhipeng Lü; Chu-Min Li 001; Weibo Lin; Fuda Ma (AAAI, 2021)

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)

From Non-Clausal to Clausal MinSAT. - Chu-Min Li 001; Felip Manyà; Joan Ramon Soler; Amanda Vidal (CCIA, 2021)

Combining Clause Learning and Branch and Bound for MaxSAT. - Chu-Min Li 001; Zhenxing Xu; Jordi Coll; Felip Manyà; Djamal Habet; Kun He 001 (CP, 2021)

Solving diversified top-k weight clique search problem. - Junping Zhou; Chumin Li 001; Yupeng Zhou; Mingyang Li; Lili Liang; Jianan Wang (Sci. China Inf. Sci., 2021)

Solving longest common subsequence problems via a transformation to the maximum clique problem. - Christian Blum 001; Marko Djukanovic; Alberto Santini; Hua Jiang; Chu-Min Li 001; Felip Manyà; Günther R. Raidl (Comput. Oper. Res., 2021)

Branching Strategy Selection Approach Based on Vivification Ratio. - Mao Luo; Chu-Min Li 001; Xinyun Wu; Shuolin Li; Zhipeng Lü (CoRR, 2021)

Clause tableaux for maximum and minimum satisfiability. - Josep Argelich; Chu Min Li 001; Felip Manyà; Joan Ramon Soler (Log. J. IGPL, 2021)

A resolution calculus for MinSAT. - Chu-Min Li 001; Fan Xiao; Felip Manyà (Log. J. IGPL, 2021)

MaxSAT, Hard and Soft Constraints. - Chu Min Li 001; Felip Manyà (Handbook of Satisfiability, 2021)

Inference in MaxSAT and MinSAT. - Chu Min Li 001; Felip Manyà (The Logic of Software. A Tasting Menu of Formal Methods, 2022)

A Tableau Calculus for MaxSAT Based on Resolution. - Shoulin Li; Jordi Coll; Djamal Habet; Chu-Min Li 001; Felip Manyà (CCIA, 2022)

HEA-D: A Hybrid Evolutionary Algorithm for Diversified Top-k Weight Clique Search Problem. - Jun Wu 020; Chu Min Li 001; Yupeng Zhou; Minghao Yin; Xin Xu; Dangdang Niu (IJCAI, 2022)

Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract). - Chu-Min Li 001; Zhenxing Xu; Jordi Coll; Felip Manyà; Djamal Habet; Kun He 001 (IJCAI, 2022)

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)

Boosting branch-and-bound MaxSAT solvers with clause learning. - Chu-Min Li 001; Zhenxing Xu; Jordi Coll; Felip Manyà; Djamal Habet; Kun He 001 (AI Commun., 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)

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)

Clausal Forms in MaxSAT and MinSAT. - Chu Min Li 001; Felip Manyà; Joan Ramon Soler; Amanda Vidal (Int. J. Comput. Intell. Syst., 2022)

Branching Strategy Selection Approach Based on Vivification Ratio. - Mao Luo; Chumin Li 001; Xinyun Wu; Shuolin Li; Zhipeng Lv (Int. J. Softw. Informatics, 2022)

Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization. - Yan Jin 005; Bowen Xiong; Kun He 001; Jin-Kao Hao; Chu-Min Li 001; Zhang-Hua Fu (IEEE Trans. Computers, 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)

A Complete Tableau Calculus for the Regular MaxSAT Problem. - Jordi Coll; Chu-Min Li 001; Felip Manyà; Elifnaz Yangin (CCIA, 2023)

A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers. - Shuolin Li; Chu-Min Li 001; Mao Luo; Jordi Coll; Djamal Habet; Felip Manyà (IJCAI, 2023)

A Tableau Calculus for Signed Maximum Satisfiability. - Shuolin Li; Jordi Coll; Djamal Habet; Chu Min Li 001; Felip Manyà (ISMVL, 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)

On solving simplified diversified top-k s-plex problem. - Jun Wu 020; Chu-Min Li 001; Luzhi Wang; Shuli Hu; Peng Zhao; Minghao Yin (Comput. Oper. Res., 2023)

Parallel Bounded Search for the Maximum Clique Problem. - Hua Jiang; Ke Bai; Hai-Jiao Liu; Chu-Min Li 001; Felip Manyà; Zhang-Hua Fu (J. Comput. Sci. Technol., 2023)

MaxSAT resolution for regular propositional logic. - Jordi Coll; Chu-Min Li 001; Felip Manyà; Elifnaz Yangin (Int. J. Approx. Reason., 2023)

A vertex weighting-based double-tabu search algorithm for the classical p-center problem. - Qingyun Zhang; Zhipeng Lü; Zhouxing Su; Chumin Li 001 (Comput. Oper. Res., 2023)

Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem. - Qingyun Zhang; Yuming Du; Zhouxing Su; Chu-Min Li 001; Junzhou Xu; Zhihuai Chen; Zhipeng Lü (AAAI, 2024)

A Complete Tableau Calculus for Non-Clausal Regular MinSAT. - Jordi Coll; Chu Min Li 001; Felip Manyà; Elifnaz Yangin (CCIA, 2024)

Minimizing Working-Group Conflicts in Conference Session Scheduling Through Maximum Satisfiability (Short Paper). - Sami Cherif; Heythem Sattoutah; Chu-Min Li 001; Corinne Lucet; Laure Brisoux Devendeville (CP, 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)

A Swap Relaxation-Based Local Search for the Latin Square Completion Problem. - Zhenxuan Xie; Zhipeng Lü; Zhouxing Su; Chu-Min Li 001; Junwen Ding; Yuxuan Wang (IJCAI, 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)

A Tableau Calculus for Non-Clausal Regular MaxSAT. - Jordi Coll; Chu Min Li 001; Felip Manyà; Elifnaz Yangin (ISMVL, 2024)

Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme. - Yi Chu; Chu-Min Li 001; Furong Ye; Shaowei Cai 001 (SAT, 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)

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)

ROADEF_SCHEDULING. - Sami Cherif; Heythem Sattoutah; Chu Min Li 001; Corinne Lucet; Laure Brisoux Devendeville (DROPS Artifacts, 2024)

Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT. - Shuolin Li; Chu-Min Li 001; Jordi Coll; Djamal Habet; Felip Manyà (AAAI, 2025)

A Complete Tableau Calculus for Signed MaxSAT. - Jordi Coll; Chu Min Li 001; Felip Manyà; Elifnaz Yangin (ISMVL, 2025)

Maximum Satisfiability Formulations for Nonlinear Integer Programming. - Zhifei Zheng; Sami Cherif; Rui Sa Shibasaki; Chu Min Li 001; Jialu Zhang (JELIA (2), 2025)

Exact Approaches for the Diverse Satisfiability Problem. - Zhifei Zheng; Sami Cherif; Rui Sa Shibasaki; Chu Min Li 001; Jialu Zhang (JELIA (2), 2025)

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)

Complete tableau calculi for Regular MaxSAT and Regular MinSAT. - Jordi Coll; Chu Min Li 001; Felip Manyà; Elifnaz Yangin (Cogn. Syst. Res., 2025)

Solving weighted Maximum Satisfiability with Branch and Bound and clause learning. - Jordi Coll; Chu Min Li 001; Shuolin Li; Djamal Habet; Felip Manyà (Comput. Oper. Res., 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)

Integer Linear Programming Preprocessing for Maximum Satisfiability. - Jialu Zhang; Chu-Min Li 001; Sami Cherif; Shuolin Li; Zhifei Zheng (CoRR, 2025)