The following pages link to Chu-Min Li (Q337151):
Displaying 46 items.
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- (Q606910) (redirect page) (← links)
- Resolution-based lower bounds in MaxSAT (Q606913) (← links)
- A parallelization scheme based on work stealing for a class of SAT solvers (Q812442) (← links)
- Equivalent literal propagation in the DLL procedure (Q1408382) (← links)
- On the limit of branching rules for hard random unsatisfiable 3-SAT (Q1408384) (← links)
- Equivalency reasoning to solve a class of hard SAT problems. (Q1589482) (← links)
- A constraint-based approach to narrow search trees for satisfiability (Q1606970) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules (Q1652386) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- A new upper bound for the maximum weight clique problem (Q1754725) (← links)
- Optimizing with minimum satisfiability (Q1761303) (← links)
- A tableau calculus for non-clausal maximum satisfiability (Q2180507) (← links)
- Clause vivification by unit propagation in CDCL SAT solvers (Q2287199) (← links)
- Local search for diversified top-\(k\) clique search problem (Q2289947) (← links)
- Exploiting multivalued knowledge in variable selection heuristics for SAT solvers (Q2385440) (← links)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- New heuristics for packing unequal circles into a circular container (Q2489278) (← links)
- Dynamic reduction heuristics for the rectangle packing area minimization problem (Q2629714) (← links)
- Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
- (Q2741522) (← links)
- An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem (Q2800956) (← links)
- A Preprocessor for Max-SAT Solvers (Q3502688) (← links)
- On Inconsistent Clause-Subsets for Max-SAT Solving (Q3523061) (← links)
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers (Q3524192) (← links)
- (Q3604008) (← links)
- (Q3604010) (← links)
- Combining Adaptive Noise and Look-Ahead in Local Search for SAT (Q3612461) (← links)
- (Q3624095) (← links)
- Exploiting Cycle Structures in Max-SAT (Q3637180) (← links)
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT (Q4632177) (← links)
- Exact MinSAT Solving (Q4930605) (← links)
- Clause tableaux for maximum and minimum satisfiability (Q5018764) (← links)
- A resolution calculus for MinSAT (Q5018765) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
- Heuristics for Solving the 2D Rectangle Packing Area Minimization Problem Basing on a Dynamic Reduction Method (Q5166004) (← links)
- (Q5282985) (← links)
- Greedy algorithms for packing unequal circles into a rectangular container (Q5464427) (← links)
- Theory and Applications of Satisfiability Testing (Q5713707) (← links)
- MaxSAT resolution for regular propositional logic (Q6066845) (← links)
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem (Q6068702) (← links)
- On solving simplified diversified top-\(k\,s\)-plex problem (Q6164387) (← links)
- An efficient solution space exploring and descent method for packing equal spheres in a sphere (Q6551133) (← links)
- Integrating multi-armed bandit with local search for MaxSAT (Q6665727) (← links)
