Quasi-Convex Scoring Functions in Branch-and-Bound Ranked Search.
Peter PoensgenRalf MöllerPublished in: Open J. Databases (2020)
Keyphrases
- branch and bound
- search algorithm
- search space
- branch and bound search
- tree search
- search strategies
- scoring functions
- tree search algorithm
- lower bound
- branch and bound algorithm
- depth first search
- search strategy
- optimal solution
- beam search
- column generation
- upper bound
- reduce the search space
- branch and bound method
- quasiconvex
- scoring function
- combinatorial optimization
- utility function
- branch and bound procedure
- metaheuristic
- search tree
- search heuristics
- objective function