A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures (Q1837544): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0004-3702(83)80009-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009029907 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures |
scientific article |
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
