Are Branch and Bound and A* Algorithms Identical? - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Heuristics Année : 2003

Are Branch and Bound and A* Algorithms Identical?

Jean-Marc Labat
  • Fonction : Auteur

Résumé

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.

Dates et versions

hal-01185776 , version 1 (21-08-2015)

Identifiants

Citer

Jean-Marc Labat, Jean-Charles Pomerol. Are Branch and Bound and A* Algorithms Identical?. Journal of Heuristics, 2003, 9 (2), pp.131-143. ⟨10.1023/A:1022573412940⟩. ⟨hal-01185776⟩
59 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More