Branch-and-Bound Ranked Search by Minimizing Parabolic Polynomials.
Peter PoensgenRalf MöllerPublished in: Open J. Databases (2020)
Keyphrases
- branch and bound
- search algorithm
- search space
- branch and bound search
- tree search
- tree search algorithm
- search strategies
- lower bound
- branch and bound algorithm
- upper bound
- beam search
- column generation
- combinatorial optimization
- optimal solution
- depth first search
- branch and bound procedure
- search methods
- search strategy
- randomly generated problems
- max sat
- branch and bound method
- integer programming problems
- partial solutions
- search problems
- heuristic search
- mini bucket
- lagrangian heuristic
- game tree search
- iterative deepening
- metaheuristic
- network design problem
- linear programming relaxation
- sat problem
- search tree
- traveling salesman problem
- bnb adopt
- evolutionary algorithm