Branch-and-bound processing of ranked queries.
Yufei TaoVagelis HristidisDimitris PapadiasYannis PapakonstantinouPublished in: Inf. Syst. (2007)
Keyphrases
- branch and bound
- efficient processing
- lower bound
- branch and bound algorithm
- search algorithm
- column generation
- combinatorial optimization
- upper bound
- search space
- branch and bound procedure
- branch and bound method
- web search engines
- tree search
- optimal solution
- query processing
- beam search
- range queries
- network design problem
- search strategies
- user queries
- randomly generated problems
- lagrangian heuristic
- bayesian networks
- max sat
- tree search algorithm
- linear programming relaxation
- integer programming problems
- branch and bound search
- search tree
- depth first search
- lagrangian relaxation
- lower and upper bounds
- ranked list
- index structure
- multi objective
- objective function