Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem.
Vasco M. ManquinhoJoão P. Marques SilvaPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2002)
Keyphrases
- branch and bound
- search space
- search algorithm
- tree search
- branch and bound search
- search strategies
- branch and bound algorithm
- tree search algorithm
- column generation
- lower bound
- upper bound
- beam search
- depth first search
- sat solvers
- optimal solution
- search strategy
- randomly generated problems
- combinatorial optimization
- network design problem
- branch and bound procedure
- branch and bound method
- heuristic search
- metaheuristic
- partial solutions
- state space
- max sat
- reduce the search space
- neural network
- game tree search
- constraint satisfaction problems
- search problems
- constraint propagation
- answer set programming
- case based reasoning
- constraint solver
- mathematical programming
- search tree
- search methods