A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas.
Mark H. LiffitonMaher N. MneimnehInês LynceZaher S. AndrausJoão Marques-SilvaKarem A. SakallahPublished in: Constraints An Int. J. (2009)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- randomly generated
- np hard
- optimal solution
- randomly generated problems
- test problems
- precedence constraints
- lower bounding
- mixed integer linear programming
- combinatorial optimization
- lagrangian relaxation
- upper bounding
- search tree
- single machine scheduling problem
- max sat
- variable ordering
- branch and bound method
- maximum clique
- finding an optimal solution
- scheduling problem