Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract).
Chu-Min LiZhenxing XuJordi CollFelip ManyàDjamal HabetKun HePublished in: IJCAI (2022)
Keyphrases
- extended abstract
- branch and bound
- sat solvers
- branch and bound algorithm
- clause learning
- sat problem
- search space
- upper bound
- combinatorial optimization
- search algorithm
- search strategies
- lower bound
- max sat
- column generation
- boolean satisfiability
- optimal solution
- propositional satisfiability
- randomly generated problems
- branch and bound procedure
- satisfiability problem
- branch and bound method
- search tree
- metaheuristic
- orders of magnitude
- tree search
- network design problem
- randomly generated
- branch and bound search
- lagrangian heuristic
- sat instances
- constraint satisfaction
- heuristic search
- evolutionary algorithm
- tree search algorithm
- integer programming
- optimization problems
- bayesian networks
- knowledge base