Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
From MaRDI portal
Recommendations
- Solving molecular distance geometry problems by global optimization algorithms
- Recent advances on the discretizable molecular distance geometry problem
- The discretizable molecular distance geometry problem
- Molecular distance geometry methods: from continuous to discrete
- Constraint programming approaches for the discretizable molecular distance geometry problem
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- On the number of solutions of the discretizable molecular distance geometry problem
- scientific article; zbMATH DE number 1531961
- Computational Experience with the Molecular Distance Geometry Problem
- scientific article; zbMATH DE number 1488003
Cited in
(11)- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- On a method of nonlinear optimization for the comparison of spatial structure of molecules
- Solving a generalized distance geometry problem for protein structure determination
- scientific article; zbMATH DE number 1101492 (Why is no real title available?)
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- scientific article; zbMATH DE number 1531958 (Why is no real title available?)
- scientific article; zbMATH DE number 841190 (Why is no real title available?)
- Computational Experience with the Molecular Distance Geometry Problem
- On generating instances for the modular distance geometry problem
- Positive semidefinite relaxations for distance geometry problems.
- The discretizable molecular distance geometry problem
This page was built for publication: Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841709)