Effective use of memory in iterative deepening search
type: Item
instance of: scholarly article
title: Effective use of memory in iterative deepening search
zbMATH Open document ID: 0772.68086
DOI: 10.1016/0020-0190(92)90131-E
author: U. K. Sarkar
author: S. De Sarkar
author: P. P. Chakrabarti
author: Sujoy Ghose
published in: Information Processing Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 92091
zbMATH Keywords: \(IDA^*\)
zbMATH Keywords: tree search
zbMATH Keywords: approximation algorithm
zbMATH Keywords: \(A^*\)
zbMATH Keywords: flow-shop scheduling problem
MaRDI profile type: Publication
cites work: Three approaches to heuristic search in networks
cites work: Heuristic search in restricted memory
cites work: Increasing search efficiency using multiple heuristics
cites work: Generalized best-first search strategies and the optimality of A*
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Q3856120
cites work: Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
Recommended article: Q4460711
Recommended article: Heuristic search in restricted memory
Recommended article: Efficient retrieval from sparse associative memory
Recommended article: Memory and Learning in Metaheuristics
Recommended article: Learning for efficient search
Recommended article: Iterative Deepening Dynamically Improved Bounds Bidirectional Search
Recommended article: Q3108908
description: scientific article; zbMATH DE number 92091