A general branch and bound formulation for understanding and synthesizing and/or tree search procedures
✍ Scribed by Vipin Kumar; Laveen N. Kanal
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 865 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
✦ Synopsis
Citing the confusing statements in the AI literature concerning the relationship between branch and bound (B&B) and heuristic search procedures we present a simple and general form,dation of B&B which shouM help dispel ranch of the confusion. We ilhtstrate the utility of the form ulation by showblg that through it some apparently very different algorithms for searching And~Or trees reveal the speciftc nature of their shnilarities and differences, bz addition to git'ing new insights into the relationships among some AI search algo.rithms, the general formulation also pros'ides suggestions on how existing search procedures may be t,aried to obtain new algorithms.