A GRASP algorithm for the Closest String Problem using a probability-based heuristic.
Sayyed Rasoul MousaviNavid Nasr EsfahaniPublished in: Comput. Oper. Res. (2012)
Keyphrases
- dynamic programming
- experimental evaluation
- learning algorithm
- detection algorithm
- simulated annealing
- computational complexity
- np hard
- greedy heuristic
- optimal solution
- segmentation algorithm
- preprocessing
- linear programming
- recognition algorithm
- optimization algorithm
- similarity measure
- high accuracy
- clustering method
- computational cost
- objective function
- extremal optimization
- convex hull
- combinatorial optimization
- benchmark problems
- heuristic rules
- bin packing
- probabilistic model
- times faster
- markov random field
- cost function
- significant improvement
- search space
- lower bound
- search algorithm
- decision trees
- feature selection