Are Branch and Bound and A* Algorithms Identical?
Jean-Marc LabatJean-Charles PomerolPublished in: J. Heuristics (2003)
Keyphrases
- branch and bound
- combinatorial optimization
- lower bound
- beam search
- branch and bound algorithm
- tree decomposition
- search space
- upper bound
- bucket elimination
- neural network
- partial solutions
- column generation
- graphical models
- optimization problems
- search algorithm
- optimal solution
- search methods
- worst case
- branch and bound search
- branch and bound method
- tree search algorithm