Global Continuation for Distance Geometry Problems
SIAM Journal on Optimization
Distance Geometry Optimization for Protein Structures
Journal of Global Optimization
Journal of Global Optimization
3D Graph Drawing with Simulated Annealing
GD '95 Proceedings of the Symposium on Graph Drawing
On convex relaxations of quadrilinear terms
Journal of Global Optimization
On the computation of protein backbones by using artificial backbones of hydrogens
Journal of Global Optimization
On the number of solutions of the discretizable molecular distance geometry problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
The discretizable molecular distance geometry problem
Computational Optimization and Applications
Hi-index | 0.00 |
We discuss the geometrical interpretation of a well-known smoothing operator applied to the Molecular Distance Geometry Problem (MDGP), and we then describe a heuristic approach based on Variable Neighbourhood Search on the smoothed and original problem. This algorithm often manages to find solutions having higher accuracy than other methods. This is important as small differences in the objective function value may point to completely different 3D molecular structures.