A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem.
Leo LibertiCarlile LavorNelson MaculanPublished in: Int. Trans. Oper. Res. (2008)
Keyphrases
- dynamic programming
- times faster
- computational complexity
- search space
- learning algorithm
- objective function
- detection algorithm
- computationally efficient
- input data
- experimental evaluation
- particle swarm optimization
- minimum distance
- distance function
- segmentation algorithm
- significant improvement
- preprocessing
- three dimensional
- np hard
- probabilistic model
- worst case
- cost function
- multi objective
- k means
- optimization algorithm
- shortest path
- data streams
- euclidean distance
- image sequences
- convex hull