Utility of pathmax in partial order heuristic search

DOI10.1016/0020-0190(95)00086-RzbMath0875.68770OpenAlexW2083275750MaRDI QIDQ1352123

Pallab Dasgupta, Partha Pratim Chakrabarti, S. C. de Sarkar

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00086-r

zbMATH Keywords

Artificial intelligenceHeuristic searchMultiobjective optimization

Mathematics Subject Classification ID

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

Related Items (1)

Lower bound sets for biobjective shortest path problems

Cites Work

• Unnamed Item
• A heuristic search algorithm with modifiable estimate
• On the complexity of admissible search algorithms
• On the optimality of A
• Heuristic search in restricted memory
• Generalized best-first search strategies and the optimality of A*
• Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
• Multiobjective A*

This page was built for publication: Utility of pathmax in partial order heuristic search