The Molecule Problem: Exploiting Structure in Global Optimization
From MaRDI portal
Recommendations
- Computational Experience with the Molecular Distance Geometry Problem
- scientific article; zbMATH DE number 1101492
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- scientific article; zbMATH DE number 2188749
Cited in
(46)- The realizable extension problem and the weighted graph \((K _{3,3}, l)\)
- Minimum size highly redundantly rigid graphs in the plane
- Euclidean distance matrices and applications
- An impossible combinatorial counting method in distance geometry
- Semidefinite programming for discrete optimization and matrix completion problems
- Series parallel linkages
- Cuts, matrix completions and graph rigidity
- scientific article; zbMATH DE number 1101491 (Why is no real title available?)
- Global optimization for molecular conformation problems
- The discretizable molecular distance geometry problem
- Generic unlabeled global rigidity
- LRA: local rigid averaging of stretchable non-rigid shapes
- Globally rigid circuits of the direction-length rigidity matroid
- Generically globally rigid graphs have generic universally rigid frameworks
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- Extremal families of redundantly rigid graphs in three dimensions
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- A tree-structured covalent-Bond-driven molecular memetic algorithm for optimization of ring-deficient molecules
- Distance geometry algorithms in molecular modelling of polymer and composite systems.
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- Diagonally dominant programming in distance geometry
- Pebble game algorithms and sparse graphs
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Positive semidefinite relaxations for distance geometry problems.
- Molecular distance geometry methods: from continuous to discrete
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Rigid versus unique determination of protein structures with geometric buildup
- scientific article; zbMATH DE number 1101495 (Why is no real title available?)
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Connected rigidity matroids and unique realizations of graphs
- scientific article; zbMATH DE number 841192 (Why is no real title available?)
- Euclidean distance matrix completion problems
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- On the uniqueness of Euclidean distance matrix completions.
- The unassigned distance geometry problem
- An extension of the angular synchronization problem to the heterogeneous setting
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Least-squares approximations in geometric buildup for solving distance geometry problems
- A Riemannian dimension-reduced second-order method with application in sensor network localization
- Theory of semidefinite programming for sensor network localization
- Hybrid spectral gradient method for the unconstrained minimization problem
- Searching for spreads and packings
- Stable camera motion estimation using convex programming
This page was built for publication: The Molecule Problem: Exploiting Structure in Global Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862785)
