Boosting branch-and-bound MaxSAT solvers with clause learning.
Chu-Min LiZhenxing XuJordi CollFelip ManyàDjamal HabetKun HePublished in: AI Commun. (2022)
Keyphrases
- branch and bound
- clause learning
- sat solvers
- search space
- sat problem
- search strategies
- branch and bound algorithm
- search algorithm
- boolean satisfiability
- lower bound
- sat solving
- upper bound
- propositional satisfiability
- max sat
- combinatorial optimization
- column generation
- sat instances
- orders of magnitude
- branch and bound procedure
- maximum satisfiability
- optimal solution
- tree search
- search tree
- learning algorithm
- constraint satisfaction
- beam search
- branch and bound method
- search strategy
- constraint satisfaction problems
- heuristic search
- satisfiability problem
- branch and bound search
- randomly generated
- genetic algorithm
- metaheuristic
- state space
- special case
- knowledge base