An Incremental Branch-and-Bound Method for the Satisfiability Problem.
Hachemi BennaceurIdir GouachiGérard PlateauPublished in: INFORMS J. Comput. (1998)
Keyphrases
- satisfiability problem
- branch and bound method
- branch and bound
- search algorithm
- lower bound
- branch and bound algorithm
- mixed integer programming
- np complete
- temporal logic
- optimal configuration
- reduce the search space
- feasible solution
- phase transition
- sat problem
- stochastic local search algorithms
- search space
- column generation
- max sat
- sat instances
- combinatorial optimization
- upper bound
- randomly generated
- np hard
- optimal solution
- stochastic local search
- simulated annealing
- expressive power