Combining Clause Learning and Branch and Bound for MaxSAT.
Chu-Min LiZhenxing XuJordi CollFelip ManyàDjamal HabetKun HePublished in: CP (2021)
Keyphrases
- branch and bound
- sat solvers
- branch and bound algorithm
- clause learning
- sat problem
- search space
- combinatorial optimization
- upper bound
- lower bound
- search strategies
- search algorithm
- max sat
- column generation
- boolean satisfiability
- branch and bound method
- propositional satisfiability
- search tree
- branch and bound search
- randomly generated problems
- optimal solution
- sat instances
- randomly generated
- tree search
- branch and bound procedure
- tree search algorithm
- network design problem
- metaheuristic
- constraint satisfaction
- orders of magnitude
- mathematical programming
- simulated annealing
- cost function
- data structure