Heuristic and Special Case Algorithms for Dispersion Problems.
S. S. RaviDaniel J. RosenkrantzGiri Kumar TayiPublished in: Oper. Res. (1994)
Keyphrases
- special case
- combinatorial optimization
- optimization problems
- approximate solutions
- computational complexity
- exact algorithms
- problems in computer vision
- greedy algorithms
- difficult problems
- related problems
- benchmark problems
- solution quality
- test problems
- practical problems
- data structure
- computationally efficient
- heuristic methods
- approximation algorithms
- test instances
- search problems
- combinatorial problems
- heuristic search algorithms
- computational geometry
- mathematical programming
- backtracking search
- learning algorithm
- significant improvement
- orders of magnitude
- np hard
- simulated annealing
- worst case
- computational cost
- finding an optimal solution
- exact and approximate
- dynamic programming algorithms
- partial solutions
- hill climbing
- exhaustive search
- computational efficiency
- heuristic search
- scheduling problem
- search space
- optimal solution