Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChu Min Li
Chu-Min Li – Chumin Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j41]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: 106187 (2023)- [j40]Qingyun Zhang, Zhipeng Lü, Zhouxing Su, Chumin Li:
A vertex weighting-based double-tabu search algorithm for the classical p-center problem. Comput. Oper. Res. 160: 106373 (2023) - [j39]Jordi Coll, Chu-Min Li, Felip Manyà, Elifnaz Yangin:
MaxSAT resolution for regular propositional logic. Int. J. Approx. Reason. 162: 109010 (2023) - [j38]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): 1187-1202 (2023) - [j37]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: 110144 (2023) - 2022
- [j36]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): 131-151 (2022) - [j35]Chu Min Li, Felip Manyà, Joan Ramon Soler, Amanda Vidal:
Clausal Forms in MaxSAT and MinSAT. Int. J. Comput. Intell. Syst. 15(1): 97 (2022) - [j34]Mao Luo, Chumin Li, Xinyun Wu, Shuolin Li, Zhipeng Lv:
Branching Strategy Selection Approach Based on Vivification Ratio. Int. J. Softw. Informatics 12(1): 131-151 (2022) - [j33]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): 2370-2380 (2022) - 2021
- [j32]Junping Zhou, Chumin Li, Yupeng Zhou, Mingyang Li, Lili Liang, Jianan Wang:
Solving diversified top-k weight clique search problem. Sci. China Inf. Sci. 64(5) (2021) - [j31]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: 105089 (2021) - [j30]Josep Argelich, Chu Min Li, Felip Manyà, Joan Ramon Soler:
Clause tableaux for maximum and minimum satisfiability. Log. J. IGPL 29(1): 7-27 (2021) - [j29]Chu-Min Li, Fan Xiao, Felip Manyà:
A resolution calculus for MinSAT. Log. J. IGPL 29(1): 28-44 (2021) - 2020
- [j28]Xiaolu Liu, Yuan Fang, Jiaming Chen, Zhouxing Su, Chumin Li, Zhipeng Lü:
Effective Approaches to Solve P-Center Problem via Set Covering and SAT. IEEE Access 8: 161232-161244 (2020) - [j27]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) - [j26]Jun Wu, Chu-Min Li, Lu Jiang, Junping Zhou, Minghao Yin:
Local search for diversified Top-k clique search problem. Comput. Oper. Res. 116: 104867 (2020) - 2019
- [j25]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): 72103:1-72103:13 (2019) - [j24]Zhenxing 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: 49-58 (2019) - [j23]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): 1950024:1-1950024:17 (2019) - 2018
- [j22]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): 66-77 (2018) - [j21]Chu-Min Li, Zhiwen Fang, Hua Jiang, Ke Xu:
Incremental Upper Bound for the Maximum Clique Problem. INFORMS J. Comput. 30(1): 137-153 (2018) - 2017
- [j20]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: 1-15 (2017) - [j19]Pengli Ji, Kun He, Yan Jin, Hongsheng Lan, Chumin Li:
An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules. Comput. Oper. Res. 86: 110-123 (2017) - [j18]Clément Lecat, Corinne Lucet, Chu-Min Li:
Minimum sum coloring problem: Upper bounds for the chromatic strength. Discret. Appl. Math. 233: 71-82 (2017) - 2016
- [j17]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: 799-833 (2016) - 2015
- [j16]Kun He, Pengli Ji, Chumin Li:
Dynamic reduction heuristics for the rectangle packing area minimization problem. Eur. J. Oper. Res. 241(3): 674-685 (2015) - 2014
- [j15]Zhaoyang Zhou, Chu Min Li, Chong Huang, Ruchu Xu:
An exact algorithm with learning for the graph coloring problem. Comput. Oper. Res. 51: 282-301 (2014) - 2012
- [j14]Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon:
Optimizing with minimum satisfiability. Artif. Intell. 190: 32-44 (2012) - 2010
- [j13]Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes:
Resolution-based lower bounds in MaxSAT. Constraints An Int. J. 15(4): 456-484 (2010) - 2008
- [j12]Ewald Speckenmeyer, Armando Tacchella, Vasco M. Manquinho, Chu Min Li:
Guest Editors Conclusion. J. Satisf. Boolean Model. Comput. 4(2-4) (2008) - [j11]Wanxia Wei, Chu Min Li, Harry Zhang:
A Switching Criterion for Intensification and Diversification in Local Search for SAT. J. Satisf. Boolean Model. Comput. 4(2-4): 219-237 (2008) - [j10]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes:
The First and Second Max-SAT Evaluations. J. Satisf. Boolean Model. Comput. 4(2-4): 251-278 (2008) - 2007
- [j9]Carlos Ansótegui, Jose Larrubia, Chu Min Li, Felip Manyà:
Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. Ann. Math. Artif. Intell. 49(1-4): 191-205 (2007) - [j8]Chu Min Li, Felip Manyà, Jordi Planes:
New Inference Rules for Max-SAT. J. Artif. Intell. Res. 30: 321-359 (2007) - 2006
- [j7]Wenqi Huang, Yu Li, Chu Min Li, Ru Chu Xu:
New heuristics for packing unequal circles into a circular container. Comput. Oper. Res. 33: 2125-2142 (2006) - 2005
- [j6]Bernard Jurkowiak, Chu Min Li, Gil Utard:
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers. J. Autom. Reason. 34(1): 73-101 (2005) - 2003
- [j5]Chu Min Li:
Equivalent literal propagation in the DLL procedure. Discret. Appl. Math. 130(2): 251-276 (2003) - [j4]Chu Min Li, Sylvain Gérard:
On the limit of branching rules for hard random unsatisfiable 3-SAT. Discret. Appl. Math. 130(2): 277-290 (2003) - 2001
- [j3]Bernard Jurkowiak, Chu Min Li, Gil Utard:
Parallelizing Satz Using Dynamic Workload Balancing. Electron. Notes Discret. Math. 9: 174-189 (2001) - 2000
- [j2]Chu Min Li:
Equivalency reasoning to solve a class of hard SAT problems. Inf. Process. Lett. 76(1-2): 75-81 (2000) - 1999
- [j1]Chu Min Li:
A Constraint-Based Approach to Narrow Search Trees for Satisfiability. Inf. Process. Lett. 71(2): 75-80 (1999)
Conference and Workshop Papers
- 2024
- [c76]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: 20856-20864 - 2023
- [c75]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: 4044-4051 - [c74]Jordi Coll, Chu-Min Li, Felip Manyà, Elifnaz Yangin:
A Complete Tableau Calculus for the Regular MaxSAT Problem. CCIA 2023: 359-368 - [c73]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: 1979-1987 - [c72]Shuolin Li, Jordi Coll, Djamal Habet, Chu Min Li, Felip Manyà:
A Tableau Calculus for Signed Maximum Satisfiability. ISMVL 2023: 170-175 - 2022
- [c71]Chu Min Li, Felip Manyà:
Inference in MaxSAT and MinSAT. The Logic of Software. A Tasting Menu of Formal Methods 2022: 350-369 - [c70]Shoulin Li, Jordi Coll, Djamal Habet, Chu-Min Li, Felip Manyà:
A Tableau Calculus for MaxSAT Based on Resolution. CCIA 2022: 35-44 - [c69]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: 1901-1907 - [c68]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: 1908-1914 - [c67]Jun Wu, Chu Min Li, Yupeng Zhou, Minghao Yin, Xin Xu, Dangdang Niu:
HEA-D: A Hybrid Evolutionary Algorithm for Diversified Top-k Weight Clique Search Problem. IJCAI 2022: 4821-4827 - [c66]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: 5299-5303 - 2021
- [c65]Zhouxing Su, Qingyun Zhang, Zhipeng Lü, Chu-Min Li, Weibo Lin, Fuda Ma:
Weighting-based Variable Neighborhood Search for Optimal Camera Placement. AAAI 2021: 12400-12408 - [c64]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: 12445-12452 - [c63]Chu-Min Li, Felip Manyà, Joan Ramon Soler, Amanda Vidal:
From Non-Clausal to Clausal MinSAT. CCIA 2021: 27-36 - [c62]Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He:
Combining Clause Learning and Branch and Bound for MaxSAT. CP 2021: 38:1-38:18 - 2020
- [c61]Yanli Liu, Chu-Min Li, Hua Jiang, Kun He:
A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems. AAAI 2020: 2392-2399 - [c60]Weibo Lin, Fuda Ma, Zhouxing Su, Qingyun Zhang, Chumin Li, Zhipeng Lü:
Weighting-based parallel local search for optimal camera placement and unicost set covering. GECCO Companion 2020: 3-4 - [c59]Qingyun Zhang, Zhipeng Lü, Zhouxing Su, Chumin Li, Yuan Fang, Fuda Ma:
Vertex Weighting-Based Tabu Search for p-Center Problem. IJCAI 2020: 1481-1487 - [c58]Chu Min Li, Felip Manyà, Amanda Vidal:
Tableaux for Maximum Satisfiability in Łukasiewicz Logic. ISMVL 2020: 243-248 - 2019
- [c57]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: 2262-2271 - [c56]Chu Min Li, Felip Manyà, Joan Ramon Soler:
Clausal Form Transformation in MaxSAT. ISMVL 2019: 132-137 - [c55]Chu Min Li, Felip Manyà, Joan Ramon Soler:
A Tableau Calculus for Non-clausal Maximum Satisfiability. TABLEAUX 2019: 58-73 - 2018
- [c54]Hua Jiang, Chu-Min Li, Yanli Liu, Felip Manyà:
A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem. AAAI 2018: 1338-1346 - [c53]Josep Argelich, Chu Min Li, Felip Manyà, Joan Ramon Soler:
Clause Branching in MaxSAT and MinSAT. CCIA 2018: 17-26 - [c52]Jian Li, Guofu Wu, Chumin Li, Mengling Xiao, Yunong Zhang:
GMDS-ZNN Variants Having Errors Proportional to Sampling Gap as Compared with Models 1 and 2 Having Higher Precision. ICSAI 2018: 728-733 - 2017
- [c51]Hua Jiang, Chu-Min Li, Felip Manyà:
An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs. AAAI 2017: 830-838 - [c50]Clément Lecat, Corinne Lucet, Chu-Min Li:
New Lower Bound for the Minimum Sum Coloring Problem. AAAI 2017: 853-859 - [c49]Mao Luo, Chu-Min Li, Fan Xiao, Felip Manyà, Zhipeng Lü:
An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers. IJCAI 2017: 703-711 - [c48]Josep Argelich, Chu Min Li, Felip Manyà:
Exploiting Many-Valued Variables in MaxSAT. ISMVL 2017: 155-160 - 2016
- [c47]Chu Min Li, Felip Manyà, Joan Ramon Soler:
A Clause Tableau Calculus for MinSAT. CCIA 2016: 88-97 - [c46]Hua Jiang, Chu Min Li, Felip Manyà:
Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs. ECAI 2016: 939-947 - [c45]Yanli Liu, Chumin Li, Kun He, Yi Fan:
Breaking Cycle Structure to Improve Lower Bound for Max-SAT. FAW 2016: 111-124 - [c44]Chu Min Li, Felip Manyà, Joan Ramon Soler:
A Clause Tableau Calculus for MaxSAT. IJCAI 2016: 766-772 - 2015
- [c43]Chu Min Li, Felip Manyà:
An Exact Inference Scheme for MinSAT. IJCAI 2015: 1959-1965 - [c42]Chu-Min Li, Hua Jiang, Ruchu Xu:
Incremental MaxSAT Reasoning to Reduce Branches in a Branch-and-Bound Algorithm for MaxClique. LION 2015: 268-274 - [c41]Chu Min Li, Fan Xiao, Ruchu Xu:
On Reducing Clause DataBase in Glucose. IWIL@LPAR 2015: 67-77 - 2014
- [c40]Zhiwen Fang, Chu-Min Li, Kan Qiao, Xu Feng, Ke Xu:
Solving Maximum Weight Clique Using Maximum Satisfiability Reasoning. ECAI 2014: 303-308 - [c39]Josep Argelich, Chu Min Li, Felip Manyà, Zhu Zhu:
Many-Valued MinSAT Solving. ISMVL 2014: 32-37 - 2013
- [c38]Josep Argelich, Chu Min Li, Felip Manyà, Zhu Zhu:
MinSAT versus MaxSAT for Optimization Problems. CP 2013: 133-142 - [c37]Chu-Min Li, Zhiwen Fang, Ke Xu:
Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem. ICTAI 2013: 939-946 - 2012
- [c36]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Chu Min Li:
Analysis and Generation of Pseudo-Industrial MaxSAT Instances. CCIA 2012: 173-184 - [c35]Carlos Ansótegui, Chu Min Li, Felip Manyà, Zhu Zhu:
A SAT-Based Approach to MinSAT. CCIA 2012: 185-189 - [c34]Zhu Zhu, Chu Min Li, Felip Manyà, Josep Argelich:
A New Encoding from MinSAT into MaxSAT. CP 2012: 455-463 - [c33]Chu Min Li, Yu Li:
Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation). SAT 2012: 477-478 - [c32]Chu Min Li, Wanxia Wei, Yu Li:
Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability - (Poster Presentation). SAT 2012: 479-480 - 2011
- [c31]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes:
Experimenting with the Instances of the MaxSAT Evaluation. CCIA 2011: 31-40 - [c30]Chu Min Li, Zhu Zhu, Felip Manyà, Laurent Simon:
Minimum Satisfiability and Its Applications. IJCAI 2011: 605-610 - [c29]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes:
Analyzing the Instances of the MaxSAT Evaluation. SAT 2011: 360-361 - 2010
- [c28]Chu Min Li, Zhe Quan:
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem. AAAI 2010: 128-133 - [c27]Chu Min Li, Zhe Quan:
Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem. ICTAI (1) 2010: 344-351 - [c26]Chu Min Li, Felip Manyà, Zhe Quan, Zhu Zhu:
Exact MinSAT Solving. SAT 2010: 363-368 - 2009
- [c25]Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes:
Exploiting Cycle Structures in Max-SAT. SAT 2009: 467-480 - 2008
- [c24]Han Lin, Kaile Su, Chu Min Li:
Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving. AAAI 2008: 351-356 - [c23]Wanxia Wei, Chu Min Li, Harry Zhang:
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT. CP 2008: 313-326 - [c22]Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes:
Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. CP 2008: 582-587 - [c21]Josep Argelich, Chu Min Li, Felip Manyà:
A Preprocessor for Max-SAT Solvers. SAT 2008: 15-20 - 2007
- [c20]Sylvain Darras, Gilles Dequen, Laure Devendeville, Chu Min Li:
On Inconsistent Clause-Subsets for Max-SAT Solving. CP 2007: 225-240 - [c19]Chu Min Li, Wanxia Wei, Harry Zhang:
Combining Adaptive Noise and Look-Ahead in Local Search for SAT. SAT 2007: 121-133 - 2006
- [c18]Chu Min Li, Felip Manyà, Jordi Planes:
Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. AAAI 2006: 86-91 - [c17]Abdellah Idrissi, Chu Min Li, Jean Frédéric Myoupo:
An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks. ICTAI 2006: 555-562 - [c16]Josep Argelich, Xavier Domingo, Chu Min Li, Felip Manyà, Jordi Planes:
Towards Solving Many-Valued MaxSAT. ISMVL 2006: 26 - [c15]Abdellah Idrissi, Chu Min Li:
Modeling and optimization of the capacity allocation problem with constraints. RIVF 2006: 107-116 - 2005
- [c14]Chu Min Li, Felip Manyà, Jordi Planes:
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. CP 2005: 403-414 - [c13]Chu Min Li, Wenqi Huang:
Diversification and Determinism in Local Search for Satisfiability. SAT 2005: 158-172 - 2003
- [c12]Wenqi Huang, Yu Li, Bernard Jurkowiak, Chu Min Li, Ru Chu Xu:
A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container. CP 2003: 868-872 - 2002
- [c11]Djamal Habet, Chu Min Li, Laure Devendeville, Michel Vasquez:
A Hybrid Approach for SAT. CP 2002: 172-184 - [c10]Hachemi Bennaceur, Chu Min Li:
Characterizing SAT Problems with the Row Convexity Property. CP 2002: 720-725 - 2000
- [c9]Chu Min Li:
Integrating Equivalency Reasoning into Davis-Putnam Procedure. AAAI/IAAI 2000: 291-296 - [c8]Chu Min Li, Sylvain Gérard:
On the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT. ECAI 2000: 98-102 - 1997
- [c7]Chu Min Li, Anbulagan:
Look-Ahead Versus Look-Back for Satisfiability Problems. CP 1997: 341-355 - [c6]Chu Min Li, Anbulagan:
Heuristics Based on Unit Propagation for Satisfiability Problems. IJCAI (1) 1997: 366-371 - 1995
- [c5]Paul Y. Gloess, Miguel-Angel Oros, Chu Min Li:
U-Log = datalog + constraints. JFPLC 1995: 369-372 - 1992
- [c4]Chu Min Li, Paul Y. Gloess:
Applying a unified object logic model to implement a strong and dynamic interface between Prolog and an OODBMS. BDA 1992: 280- - [c3]Chu Min Li, Paul Y. Gloess:
Realizing an efficient and incremental access to an object oriented database with Prolog. JFPL 1992: 268-283 - [c2]Chu Min Li, Paul Y. Gloess:
ProQuery: Logical Access to an OODB. PLILP 1992: 487-488 - [c1]Paul Y. Gloess, Yan-Nong Huang, Chumin Li, Miguel-Angel Oros:
On Boolean Feature Types. WSA 1992: 213-220
Parts in Books or Collections
- 2021
- [p2]Chu Min Li, Felip Manyà:
MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability 2021: 903-927 - 2009
- [p1]Chu Min Li, Felip Manyà:
MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability 2009: 613-631
Editorship
- 2021
- [e1]Chu-Min Li, Felip Manyà:
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings. Lecture Notes in Computer Science 12831, Springer 2021, ISBN 978-3-030-80222-6 [contents]
Informal and Other Publications
- 2024
- [i19]Jiongzhi Zheng, Zhuo Chen, Chu-Min Li, Kun He:
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers. CoRR abs/2401.10589 (2024) - [i18]Jiongzhi Zheng, Jinghui Xue, Kun He, Chu-Min Li, Yanli Liu:
An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems. CoRR abs/2404.09997 (2024) - 2023
- [i17]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 abs/2303.02650 (2023) - [i16]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 abs/2305.10023 (2023) - 2022
- [i15]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu Min Li, Felip Manyà:
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. CoRR abs/2201.05544 (2022) - [i14]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 abs/2201.06252 (2022) - [i13]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li:
Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems. CoRR abs/2207.03876 (2022) - [i12]Yanli Liu, Jiming Zhao, Chu-Min Li, Hua Jiang, Kun He:
Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem. CoRR abs/2208.08620 (2022) - [i11]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà:
Incorporating Multi-armed Bandit with Local Search for MaxSAT. CoRR abs/2211.16011 (2022) - 2021
- [i10]Mao Luo, Chu-Min Li, Xinyun Wu, Shuolin Li, Zhipeng Lü:
Branching Strategy Selection Approach Based on Vivification Ratio. CoRR abs/2112.06917 (2021) - 2020
- [i9]Kun He, Min Zhang, Jianrong Zhou, Yan Jin, Chu-Min Li:
Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem. CoRR abs/2001.08540 (2020) - [i8]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 abs/2012.04461 (2020) - 2019
- [i7]Luzhi Wang, Chu-Min Li, Junping Zhou, Bo Jin, Minghao Yin:
An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs. CoRR abs/1903.05948 (2019) - [i6]Yanli Liu, Chu-Min Li, Hua Jiang, Kun He:
A Learning based Branch and Bound for Maximum Common Subgraph Problems. CoRR abs/1905.05840 (2019) - 2018
- [i5]Chu-Min Li, Fan Xiao, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li:
Clause Vivification by Unit Propagation in CDCL SAT Solvers. CoRR abs/1807.11061 (2018) - [i4]Zhenxing Xu, Kun He, Chu-Min Li:
An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem. CoRR abs/1808.03611 (2018) - 2016
- [i3]Clément Lecat, Corinne Lucet, Chu-Min Li:
Sum Coloring : New upper bounds for the chromatic strength. CoRR abs/1609.02726 (2016) - 2014
- [i2]Kun He, Pengli Ji, Chumin Li:
An iterative merging placement algorithm for the fixed-outline floorplanning. CoRR abs/1401.3172 (2014) - 2011
- [i1]Chu Min Li, Felip Manyà, Jordi Planes:
New Inference Rules for Max-SAT. CoRR abs/1111.0040 (2011)
Coauthor Index
[j39] [j38] [j36] [j35] [j31] [j30] [j29] [j27] [j25] [j22] [j20] [j14] [j13] [j10] [j9] [j8] [c74] [c73] [c72] [c71] [c70] [c69] [c66] [c63] [c62] [c58] [c56] [c55] [c54] [c53] [c51] [c49] [c48] [c47] [c46] [c44] [c43] [c39] [c38] [c35] [c34] [c31] [c30] [c29] [c26] [c25] [c22] [c21] [c18] [c16] [c14] [p2] [p1] [e1] [i15] [i11] [i5] [i1]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-17 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
