The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems.
Sumedh PendurkarTaoan HuangSven KoenigGuni SharonPublished in: CoRR (2022)
Keyphrases
- search problems
- np hard
- search algorithm
- state space search
- beam search
- search strategies
- heuristic search algorithms
- optimal solution
- greedy heuristic
- orders of magnitude
- heuristic search
- sequencing problems
- graph search
- constraint satisfaction problems
- randomly generated problem instances
- iterative deepening
- special case
- solving hard
- search space
- branch and bound
- heuristic function
- scheduling problem
- approximation algorithms
- np complete
- branch and bound algorithm
- tabu search
- simulated annealing
- admissible heuristics
- tree search
- lower bound
- evolutionary algorithm
- real time search algorithms
- dynamic programming
- state space
- search strategy
- constraint satisfaction
- linear programming
- planning problems
- constraint programming
- computational complexity