A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure.
Celso C. RibeiroDalessandro Soares ViannaPublished in: Int. Trans. Oper. Res. (2005)
Keyphrases
- neighborhood structure
- manhattan distance
- tabu search
- multi start
- minimum spanning tree
- graph model
- nonlinear dimensionality reduction
- nearest neighbor search
- simulated annealing
- optimal solution
- metaheuristic
- euclidean distance
- feasible solution
- exact algorithms
- pattern recognition
- graph laplacian
- weighted graph
- hamming distance
- exhaustive search
- dynamic programming
- lower bound
- optimization problems
- np hard
- search algorithm