A note on "A branch-and-prune algorithm for the molecular distance geometry problem".
Carlile LavorLeo LibertiNelson MaculanPublished in: Int. Trans. Oper. Res. (2011)
Keyphrases
- dynamic programming
- preprocessing
- learning algorithm
- experimental evaluation
- cost function
- times faster
- np hard
- three dimensional
- optimization algorithm
- search space
- optimal solution
- objective function
- high accuracy
- segmentation algorithm
- particle swarm optimization
- theoretical analysis
- path planning
- convergence rate
- distance function
- detection algorithm
- average distance
- computationally efficient
- expectation maximization
- simulated annealing
- worst case
- input data
- computational cost
- significant improvement
- k means
- convex hull
- lower bound
- distance transform
- distance matrix
- similarity measure