Clause Branching in MaxSAT and MinSAT.
Josep ArgelichChu Min LiFelip ManyàJoan Ramon SolerPublished in: CCIA (2018)
Keyphrases
- branch and bound algorithm
- branch and bound
- unsatisfiable cores
- search space
- sat problem
- search tree
- boolean formula
- boolean satisfiability
- max sat
- cnf formula
- sat solvers
- combinatorial optimization
- combinatorial optimization problems
- maximum satisfiability
- lower bound
- upper bound
- clause learning
- search algorithm
- variable ordering
- optimal solution
- hidden structure
- randomly generated
- column generation
- constraint satisfaction problems
- orders of magnitude
- phase transition
- graph coloring
- np hard
- practical problems
- satisfiability problem
- combinatorial auctions
- sat instances
- np complete
- constraint satisfaction
- traveling salesman problem
- combinatorial problems
- special case
- optimization problems
- metaheuristic
- probabilistic planning
- binary decision diagrams
- tabu search
- conjunctive normal form
- boolean variables
- evolutionary algorithm
- linear constraints