Solving molecular distance geometry problems by global optimization algorithms

Author： Grosso Andrea   Locatelli Marco   Schoen Fabio  

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.43, Iss.1, 2009-05, pp. : 23-37

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Globally convergent algorithms for solving unconstrained optimization problems

By  

Optimization, Vol. 64, Iss. 2, 2015-02 ,pp. : 249-263

Taylor & Francis Ltd

Access to resources Recommend Favorite

Least-Squares Approximations in Geometric Buildup for Solving Distance Geometry Problems

By Luo Xin-long   Wu Zhi-jun  

Journal of Optimization Theory and Applications, Vol. 149, Iss. 3, 2011-06 ,pp. : 580-598

Springer Publishing Company

Access to resources Recommend Favorite

Application of Stochastic Global Optimization Algorithms to Practical Problems

By Ali M.M.   Storey C.   Törn A.  

Journal of Optimization Theory and Applications, Vol. 95, Iss. 3, 1997-12 ,pp. : 545-563

Springer Publishing Company

Access to resources Recommend Favorite

A global optimization approach for solving non-monotone variational inequality problems

By Majig M.  

Optimization, Vol. 58, Iss. 7, 2009-10 ,pp. : 871-881

Taylor & Francis Ltd

Access to resources Recommend Favorite

The role of intuition in the solving of optimization problems

By Malaspina Uldarico   Font Vicenç  

Educational Studies in Mathematics, Vol. 75, Iss. 1, 2010-09 ,pp. : 107-130

Springer Publishing Company

Access to resources Recommend Favorite