A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures (Q1837544)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3800963
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures |
scientific article; zbMATH DE number 3800963 |
Statements
A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures (English)
0 references
1983
0 references
algorithms for searching And/Or trees
0 references
0 references
0 references
