Computational Experience with the Molecular Distance Geometry Problem
From MaRDI portal
Recommendations
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- On generating instances for the modular distance geometry problem
- Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
- Solving molecular distance geometry problems by global optimization algorithms
- A stochastic/perturbation global optimization algorithm for distance geometry problems
Cited in
(37)- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- Distance geometry algorithms in molecular modelling of polymer and composite systems.
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
- Minimal NMR distance information for rigidity of protein graphs
- Preface: Special issue dedicated to distance geometry
- The discretizable distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- Benchmarking nonlinear optimization software in technical computing environments
- On convex relaxations of quadrilinear terms
- A quantum approach to the discretizable molecular distance geometry problem
- Maximum feasible subsystems of distance geometry constraints
- Distance geometry and data science
- On the optimality of finding DMDGP symmetries
- Deterministic global optimization in ab-initio quantum chemistry
- A multiplicative weights update algorithm for MINLP
- A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
- Molecular conformation search by distance matrix perturbations
- Diagonally dominant programming in distance geometry
- Global optimization for atomic cluster distance geometry problems
- Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- scientific article; zbMATH DE number 1187130 (Why is no real title available?)
- A recipe for finding good solutions to MINLPs
- The Molecule Problem: Exploiting Structure in Global Optimization
- scientific article; zbMATH DE number 841190 (Why is no real title available?)
- On the computation of protein backbones by using artificial backbones of hydrogens
- On generating instances for the modular distance geometry problem
- Positive semidefinite relaxations for distance geometry problems.
- Preface
- Cycle-based formulations in distance geometry
- Discretization orders for distance geometry problems
- The discretizable molecular distance geometry problem
- Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis
- Solving molecular distance geometry problems by global optimization algorithms
- Clifford algebra and the discretizable molecular distance geometry problem
- Extending the geometric build-up algorithm for the molecular distance geometry problem
This page was built for publication: Computational Experience with the Molecular Distance Geometry Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5427980)
