E-LIB Suche - Ergebnisse für: Li, Chu-Min

1

An efficient solution space exploring and descent method fo..:

Zhou, Jianrong ; Ren, Shuo ; He, Kun..
Computers & Operations Research. 164 (2024) - p. 106522 , 2024

Link: https://doi.org/10.1016/..

2

Geometric batch optimization for packing equal circles in a..:

Zhou, Jianrong ; He, Kun ; Zheng, Jiongzhi.
Expert Systems with Applications. 250 (2024) - p. 123952 , 2024

Link: https://doi.org/10.1016/..

3

MaxSAT resolution for regular propositional logic:

Coll, Jordi ; Li, Chu-Min ; Manyà, Felip.
International Journal of Approximate Reasoning. 162 (2023) - p. 109010 , 2023

Link: https://doi.org/10.1016/..

4

On solving simplified diversified top-k s-plex problem:

Wu, Jun ; Li, Chu-Min ; Wang, Luzhi...
Computers & Operations Research. 153 (2023) - p. 106187 , 2023

Link: https://doi.org/10.1016/..

5

Reinforced Lin–Kernighan–Helsgaun algorithms for the travel..:

Zheng, Jiongzhi ; He, Kun ; Zhou, Jianrong..
Knowledge-Based Systems. 260 (2023) - p. 110144 , 2023

Link: https://doi.org/10.1016/..

6

Clustering Driven Iterated Hybrid Search for Vertex Bisecti..:

Jin, Yan ; Xiong, Bowen ; He, Kun...
IEEE Transactions on Computers. 71 (2022) 10 - p. 2370-2380 , 2022

Link: https://doi.org/10.1109/..

7

Solving longest common subsequence problems via a transform..:

Blum, Christian ; Djukanovic, Marko ; Santini, Alberto...
Computers & Operations Research. 125 (2021) - p. 105089 , 2021

Link: https://doi.org/10.1016/..

8

Theory and Applications of Satisfiability Testing – SAT 202..

Theoretical Computer Science and General Issues, 12831

Li, Chu-Min ; Manyà, Felip - 1st ed. 2021 . , 2021

Link: https://doi.org/10.1007/..

9

Local search for diversified Top-k clique search problem:

Wu, Jun ; Li, Chu-Min ; Jiang, Lu..
Computers & Operations Research. 116 (2020) - p. 104867 , 2020

Link: https://doi.org/10.1016/..

10

Clause vivification by unit propagation in CDCL SAT solvers:

Li, Chu-Min ; Xiao, Fan ; Luo, Mao...
Artificial Intelligence. 279 (2020) - p. 103197 , 2020

Link: https://doi.org/10.1016/..

11

An iterative Path-Breaking approach with mutation and resta..:

Xu, Zhenxing ; He, Kun ; Li, Chu-Min
Computers & Operations Research. 104 (2019) - p. 49-58 , 2019

Link: https://doi.org/10.1016/..

12

A resolution calculus for MinSAT:

Li, Chu-Min ; Xiao, Fan ; Manyà, Felip
Logic Journal of the IGPL. 29 (2019) 1 - p. 28-44 , 2019

Link: https://doi.org/10.1093/..

13

A branching heuristic for SAT solvers based on complete imp..:

Xiao, Fan ; Li, Chu-Min ; Luo, Mao...
Science China Information Sciences. 62 (2019) 7 - p. , 2019

Link: https://doi.org/10.1007/..

14

A new upper bound for the maximum weight clique problem:

Li, Chu-Min ; Liu, Yanli ; Jiang, Hua..
European Journal of Operational Research. 270 (2018) 1 - p. 66-77 , 2018

Link: https://doi.org/10.1016/..

15

Incremental Upper Bound for the Maximum Clique Problem:

Li, Chu-Min ; Fang, Zhiwen ; Jiang, Hua.
INFORMS Journal on Computing. 30 (2018) 1 - p. 137-153 , 2018

Link: https://doi.org/10.1287/..