Back to Results
First PageMeta Content
Combinatorial optimization / Mathematics / Applied mathematics / Heuristic function / Admissible heuristic / Heuristic / Branch and bound / Linear programming relaxation / Relaxation / Mathematical optimization / Heuristics / Operations research


Strengthening Landmark Heuristics via Hitting Sets Blai Bonet1 and Malte Helmert2 Abstract. The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heu
Add to Reading List

Document Date: 2010-05-29 10:18:47

Open Document

File Size: 169,81 KB

Share Result on Facebook

Company

R. Hence / hypergraph HF / MIT Press / Let hF / /

/

IndustryTerm

Basic algorithms / heuristic search / breadth-first search / search topology / /

Organization

MIT / Universidad Sim´on Bol´ıvar / German Research Foundation / Institut f¨ur Informatik / /

Person

Raymond E. Miller / Silvia Richter / Richard M. Karp / Blai Bonet / Carmel Domshlak / Maria Fox / Tom Bylander / Derek Long / Find / Andrew Coles / Amanda Smith / Malte Helmert / Ai / Matthias Westphal / Erez Karpas / Charles E. Leiserson / James W. Thatcher / Christoph Betz / Thomas H. Cormen / Michael Katz / /

Position

Prime Minister / Downward planner / representative of Ai / LAMA planner / LM-cut-based planner / planner / /

Product

Satellite / /

ProgrammingLanguage

FL / /

ProvinceOrState

Florida / /

PublishedMedium

Complex Systems / /

SocialTag