A Refined Branching Algorithm for the Maximum Satisfiability Problem.
Wenjun LiChao XuYongjie YangJianer ChenJianxin WangPublished in: Algorithmica (2022)
Keyphrases
- improved algorithm
- significant improvement
- preprocessing
- high accuracy
- cost function
- dynamic programming
- data sets
- experimental study
- neural network
- objective function
- computationally efficient
- computational cost
- worst case
- single pass
- particle swarm optimization
- optimization algorithm
- matching algorithm
- experimental evaluation
- np hard
- k means
- learning algorithm
- semi supervised
- scheduling problem
- probabilistic model
- simulated annealing
- linear programming
- theoretical analysis
- optimal solution
- energy function
- tree structure
- similarity measure
- feature selection