Reducing reexpansions in iterative-deepening search by controlling cutoff bounds (Q1187216)
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: Reducing reexpansions in iterative-deepening search by controlling cutoff bounds |
scientific article; zbMATH DE number 38977
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing reexpansions in iterative-deepening search by controlling cutoff bounds |
scientific article; zbMATH DE number 38977 |
Statements
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds (English)
0 references
28 June 1992
0 references
heuristic search
0 references
0/1 knapsack problem
0 references
traveling Salesman problem
0 references
A*
0 references
IDA*
0 references
