Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
- 31 July 1991
- journal article
- research article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 50 (2), 207-221
- https://doi.org/10.1016/0004-3702(91)90100-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Multiple stack branch and boundInformation Processing Letters, 1991
- Heuristic search in restricted memoryArtificial Intelligence, 1989
- Depth-first iterative-deepeningArtificial Intelligence, 1985
- Approximate Traveling Salesman AlgorithmsOperations Research, 1980
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963