A New Result on the Complexity of Heuristic Estimates for the A* Algorithm.
Othar HanssonAndrew MayerMarco ValtortaPublished in: Artif. Intell. (1992)
Keyphrases
- dynamic programming
- worst case
- computational cost
- optimization algorithm
- experimental evaluation
- optimal solution
- significant improvement
- learning algorithm
- detection algorithm
- simulated annealing
- multi objective
- computational complexity
- high accuracy
- bin packing
- linear complexity
- search procedure
- times faster
- greedy heuristic
- cost function
- heuristic rules
- exact algorithms
- exhaustive search
- tabu search
- particle swarm optimization
- objective function
- ant colony optimization
- convex hull
- convergence rate
- solution quality
- genetic algorithm
- hill climbing
- job shop scheduling problem
- complexity analysis
- packing problem
- decision trees
- np complete
- linear programming