Picture for Chu-Min Li

Chu-Min Li

Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers

Add code
Jan 19, 2024
Viaarxiv icon

Incorporating Multi-armed Bandit with Local Search for MaxSAT

Add code
Nov 29, 2022
Viaarxiv icon

Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem

Add code
Aug 18, 2022
Figure 1 for Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem
Figure 2 for Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem
Figure 3 for Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem
Figure 4 for Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem
Viaarxiv icon

Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems

Add code
Jul 15, 2022
Figure 1 for Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems
Figure 2 for Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems
Figure 3 for Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems
Figure 4 for Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems
Viaarxiv icon

Branching Strategy Selection Approach Based on Vivification Ratio

Add code
Dec 11, 2021
Figure 1 for Branching Strategy Selection Approach Based on Vivification Ratio
Figure 2 for Branching Strategy Selection Approach Based on Vivification Ratio
Figure 3 for Branching Strategy Selection Approach Based on Vivification Ratio
Figure 4 for Branching Strategy Selection Approach Based on Vivification Ratio
Viaarxiv icon

An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem

Add code
Aug 10, 2018
Figure 1 for An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem
Figure 2 for An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem
Figure 3 for An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem
Figure 4 for An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem
Viaarxiv icon

Clause Vivification by Unit Propagation in CDCL SAT Solvers

Add code
Jul 29, 2018
Figure 1 for Clause Vivification by Unit Propagation in CDCL SAT Solvers
Figure 2 for Clause Vivification by Unit Propagation in CDCL SAT Solvers
Figure 3 for Clause Vivification by Unit Propagation in CDCL SAT Solvers
Figure 4 for Clause Vivification by Unit Propagation in CDCL SAT Solvers
Viaarxiv icon