A stochastic/perturbation global optimization algorithm for distance geometry problems
From MaRDI portal
Recommendations
Cited in
(19)- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- Recent advances on the interval distance geometry problem
- A novel canonical dual computational approach for prion AGAAAAGA amyloid fibril molecular modeling
- Distance geometry optimization for protein structures
- A Euclidean distance matrix model for protein molecular conformation
- Global optimization for atomic cluster distance geometry problems
- scientific article; zbMATH DE number 1187130 (Why is no real title available?)
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- Global Continuation for Distance Geometry Problems
- scientific article; zbMATH DE number 1488890 (Why is no real title available?)
- The Molecule Problem: Exploiting Structure in Global Optimization
- scientific article; zbMATH DE number 841190 (Why is no real title available?)
- Euclidean distance matrix completion problems
- Computational Experience with the Molecular Distance Geometry Problem
- Positive semidefinite relaxations for distance geometry problems.
- Least-squares approximations in geometric buildup for solving distance geometry problems
- The discretizable molecular distance geometry problem
- Solving molecular distance geometry problems by global optimization algorithms
- An application of a global optimization parametrization method on macromolecular structure problem
This page was built for publication: A stochastic/perturbation global optimization algorithm for distance geometry problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374376)
