Iterative deepening multiobjective \(A^{*}\)

DOI10.1016/0020-0190(96)00009-9zbMath1004.68524OpenAlexW2049188296MaRDI QIDQ1351151

O. Diekmann

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(96)00009-9

zbMATH Keywords

optimizationalgorithmscombinatorial problemsanalysis of algorithmsmultiobjective search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Related Items (1)

Partial order bounding: A new approach to evaluation in game tree search

Cites Work

• Depth-first iterative-deepening: An optimal admissible tree search
• Multiobjective A*
• Time and tape complexity of pushdown automaton languages
• Unnamed Item
• Unnamed Item

This page was built for publication: Iterative deepening multiobjective \(A^{*}\)