Reducing reexpansions in iterative-deepening search by controlling cutoff bounds (Q1187216): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Approximate Traveling Salesman Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Heuristic search in restricted memory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-first iterative-deepening: An optimal admissible tree search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3856120 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multiple stack branch and bound / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0004-3702(91)90100-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077166305 / rank | |||
Normal rank | |||
Latest revision as of 11:11, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing reexpansions in iterative-deepening search by controlling cutoff bounds |
scientific article |
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
