Skip to main content
SpringerLink
Log in

Are Branch and Bound and A* Algorithms Identical?

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Dechter, R. and J. Pearl. (1988). “The Optimality of A*.” In L. Kanal and V. Kumar (eds.), Search in Artificial Intelligence, Berlin: Springer, pp. 166–199.

    Google Scholar 

  • Eiben, A.E., E.H.L. Aarts, K.M. Van Hee, and W.P.M. Nuijten. (1995). “AUnifying Approach to Heuristic Search.” In Annals of Operations Research 55, 81–99.

    Google Scholar 

  • Farreny, H. (1995). Recherche heuristiquement ordonnée dans les graphes d'éetats. Paris: Masson.

    Google Scholar 

  • Farreny, H. and M. Ghallab. (1987). Eléments d'Intelligence Artificielle. Paris: Hermés.

    Google Scholar 

  • Glover, F. and M. Laguna. (1993). “Tabu Search.” In C.R. Reeves (ed.), Modern Heuristic Techniques for Combi-natorial Problems, pp. 70–150.

  • Kumar, V. and L. Kanal. (1983). “A General B & B Formulation for Understanding and Synthesizing AND/OR Tree Search Procedures.” Artificial Intelligence 21, 179–198.

    Google Scholar 

  • Kumar, V., D.S. Nau, and L. Kanal. (1988). “A General B & B Formulation for AND/OR Graph and Game Tree Search.” In L. Kanal and V. Kumar (eds.), Search in Artificial Intelligence. Berlin: Springer, pp. 91–130.

    Google Scholar 

  • Nau, D.S., V. Kumar, and L. Kanal. (1984). “General Branch and Bound, and its Relation to A* and AO*.” Artificial Intelligence 23, 29–58.

    Google Scholar 

  • Newell, A. and H.A. Simon. (1972). Human Problem Solving. Englewood Cliffs, NJ: Prentice-Hall.

    Google Scholar 

  • Nilsson, N. (1971). Problem-Solving Methods in Artificial Intelligence. New York: Mac Graw Hill.

    Google Scholar 

  • Nilsson, N. (1982). Principles of Artificial Intelligence. Berlin: Springer.

    Google Scholar 

  • Pearl, J. (1984). Heuristics. Readings, MA: Addison-Wesley.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CRIP5, Paris V University, rue des Saints Pères, Paris 6, France

    Jean-Marc Labat

  2. LIP6, Paris VI University, 4 place Jussieu, 75252, Paris, Cedex 05, France

    Jean-Charles Pomerol

Authors
  1. Jean-Marc Labat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Charles Pomerol
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Labat, JM., Pomerol, JC. Are Branch and Bound and A* Algorithms Identical?. Journal of Heuristics 9, 131–143 (2003). https://doi.org/10.1023/A:1022573412940

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022573412940

Search

Navigation