A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas.
Maher N. MneimnehInês LynceZaher S. AndrausJoão P. Marques SilvaKarem A. SakallahPublished in: SAT (2005)
Keyphrases
- branch and bound algorithm
- unsatisfiable cores
- max sat
- boolean satisfiability
- lower bound
- branch and bound
- upper bound
- optimal solution
- randomly generated
- np hard
- weighted max sat
- lower bounding
- combinatorial optimization
- precedence constraints
- mixed integer linear programming
- cnf formula
- variable ordering
- lagrangian relaxation
- single machine scheduling problem
- randomly generated problems
- branch and bound method
- upper bounding
- objective function
- search algorithm
- neural network
- special case
- integer variables
- search space
- propositional satisfiability
- scheduling problem