A general paradigm for A.I. search procedures
Dana S. Nau, Vipin Kumar, Laveen N. Kanal · 1982
This paper summarizes work on a General Branch and Bound formulation which includes previous formulations as special cases and provides a unified approach to understanding most heuristic search procedures developed in A.I. A wide class of problems arising in Operations Research, decision making and Artificial Intelligence can be (abstractly) stated in the following form: