Are branch and bound and A* algorithms identical?

Heuristic Search and Branch and Bound algorithms have many similarities. In this paper, we address the question of the extent to which they are similar. We firstly show that these algorithms apply the same principles, although generating graphs with different properties: Heuristic Search can explore any kind of graphs, whereas the Branch and Bound algorithm generates particular graphs with a restrictive inheritance property. Nevertheless, we show that the Branch and Bound principles can be used to perform Heuristic Search. We conclude that the two types of algorithms are therefore essentially identical; they only differ at the interpretation level.