Strengthening Landmark Heuristics via Hitting Sets
From MaRDI portal
Publication:2999151
DOI10.3233/978-1-60750-606-5-329zbMath1211.90297OpenAlexW1501886372MaRDI QIDQ2999151
Publication date: 11 May 2011
Full work available at URL: http://gki.informatik.uni-freiburg.de/papers/bonet-helmert-ecai2010.pdf
Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Width-based search for multi agent privacy-preserving planning ⋮ Landmark-enhanced abstraction heuristics ⋮ The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
This page was built for publication: Strengthening Landmark Heuristics via Hitting Sets