Reducing reexpansions in iterative-deepening search by controlling cutoff bounds

DOI10.1016/0004-3702(91)90100-XzbMath0764.68157OpenAlexW2077166305MaRDI QIDQ1187216

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

Publication date: 28 June 1992

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(91)90100-x

zbMATH Keywords

heuristic searchIDA*0/1 knapsack problemA*traveling Salesman problem

Mathematics Subject Classification ID

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

Related Items

Agent searching in a tree and the optimality of iterative deepening ⋮ Effective use of memory in iterative deepening search ⋮ Linear-space best-first search ⋮ Iterative-deepening search with on-line tree size prediction ⋮ On uniqueness of solution to the multi-peg towers of hanoi ⋮ The \(PN^{*}\)-search algorithm: Application to tsume-shogi ⋮ Potential-based bounded-cost search and anytime non-parametric A* ⋮ Heuristic search strategies for multiobjective state space search ⋮ Performance of linear-space search algorithms ⋮ Performance of linear-space search algorithms ⋮ On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem ⋮ Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization ⋮ \(\text{BIDA}^*\): An improved perimeter search algorithm

Cites Work

• Unnamed Item
• Multiple stack branch and bound
• Depth-first iterative-deepening: An optimal admissible tree search
• Heuristic search in restricted memory
• Approximate Traveling Salesman Algorithms
• An Algorithm for the Traveling Salesman Problem