Effective use of memory in iterative deepening search

DOI10.1016/0020-0190(92)90131-EzbMath0772.68086MaRDI QIDQ1198022

U. K. Sarkar, S. C. de Sarkar, Partha Pratim Chakrabarti, Sujoy Ghose

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmtree search\(A^*\)\(IDA^*\)flow-shop scheduling problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Heuristic search strategies for multiobjective state space search ⋮ \(\text{BIDA}^*\): An improved perimeter search algorithm

Cites Work

• Depth-first iterative-deepening: An optimal admissible tree search
• Increasing search efficiency using multiple heuristics
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• Heuristic search in restricted memory
• Generalized best-first search strategies and the optimality of A*
• Three approaches to heuristic search in networks
• Unnamed Item

This page was built for publication: Effective use of memory in iterative deepening search