A parallel version of the Branch & Prune algorithm for the Molecular Distance Geometry Problem.
Antonio MucherinoCarlile LavorLeo LibertiEl-Ghazali TalbiPublished in: AICCSA (2010)
Keyphrases
- parallel version
- learning algorithm
- objective function
- search space
- dynamic programming
- parallel algorithm
- particle swarm optimization
- evolutionary algorithm
- np hard
- simulated annealing
- linear programming
- combinatorial optimization
- convergence rate
- evaluation function
- search problems
- iterative deepening
- optimal solution