Are branch and bound and A\(^{\ast}\) algorithms identical? (Q1402513)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Are branch and bound and A\(^{\ast}\) algorithms identical? |
scientific article; zbMATH DE number 1972149
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Are branch and bound and A\(^{\ast}\) algorithms identical? |
scientific article; zbMATH DE number 1972149 |
Statements
Are branch and bound and A\(^{\ast}\) algorithms identical? (English)
0 references
28 August 2003
0 references
heuristic search
0 references
branch and bound
0 references
A\(^{\ast}\) algorithm
0 references
