New insights into the relationships among branch and bound, dynamic programming and heuristic search procedures
Summary form only given, as follows. The authors first cite the great confusion which exists in the literature regarding the precise nature of dynamic programming (DP), branch and bound (bandb) procedures, the relationships between them, and their relationships to various heuristic search procedures of artificial intelligence. They then briefly outline the concept of a composite decision process as a general model for discrete optimization problems. This new model is applicable to state-space search, problem-reduction search, game-tree search various discrete deterministic optimization problems. It has helped in explaining the relationships among various search algorithms, in providing insights into their individual peculiarities, and in suggesting additional search procedures. Some of the authors results concerning the nature of DP, bandb, and their relationships with each other and with various heuristic search procedures are summarized, and some of the confusion concerning DP, bandb, and heuristic search algorithms such as A*, AO*, B*, SSS*, alpha-beta and their generalizations are dispelled. 5 references.
- OSTI ID:
- 5135407
- Country of Publication:
- United States
- Language:
- English
Similar Records
Heuristic search method for optimal zonation of well logs
A continuous based heuristic for the maximum clique problem