On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds.

William Lam Kalev Kask Rina Dechter Javier Larrosa

Published in: ECAI (2016)

Keyphrases

lower bound
branch and bound
upper bound
branch and bound algorithm
heuristic search
objective function
dynamic programming
search algorithm
search tree
lower and upper bounds
search space
np hard
worst case
upper and lower bounds