An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined Observations.
Wenjun LiChao XuJianxin WangYongjie YangPublished in: COCOA (2) (2017)
Keyphrases
- randomly generated
- branch and bound algorithm
- branch and bound
- optimal solution
- cost function
- np hard
- data sets
- upper bound
- simulated annealing
- dynamic programming
- selection algorithm
- expectation maximization
- linear programming
- experimental evaluation
- search space
- preprocessing
- objective function
- reinforcement learning
- bayesian networks