Solving molecular distance geometry problems by global optimization algorithms
- 7 November 2007
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 43 (1) , 23-37
- https://doi.org/10.1007/s10589-007-9127-8
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An experimental analysis of a population based approach for global optimizationComputational Optimization and Applications, 2007
- A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity MeasuresMathematical Programming, 2006
- On the Multilevel Structure of Global Optimization ProblemsComputational Optimization and Applications, 2005
- Global Optimization of Morse Clusters by Potential Energy TransformationsINFORMS Journal on Computing, 2004
- A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance DataJournal of Global Optimization, 2003
- Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones ClustersComputational Optimization and Applications, 2003
- Global Optimization on Funneling LandscapesJournal of Global Optimization, 2000
- Distance Geometry Optimization for Protein StructuresJournal of Global Optimization, 1999
- Global Continuation for Distance Geometry ProblemsSIAM Journal on Optimization, 1997
- Global Optima of Lennard-Jones ClustersJournal of Global Optimization, 1997