On generating instances for the modular distance geometry problem
From MaRDI portal
Recommendations
- Computational Experience with the Molecular Distance Geometry Problem
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- The discretizable molecular distance geometry problem
Cited in
(12)- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- On convex relaxations of quadrilinear terms
- A note on the Cayley-Menger determinant and the molecular distance geometry problem
- Unassigned distance geometry and molecular conformation problems
- A constrained interval approach to the generalized distance geometry problem
- An algorithm for realizing Euclidean distance matrices
- Extended formulations for convex envelopes
- New error measures and methods for realizing protein graphs from distance data
- On the computation of protein backbones by using artificial backbones of hydrogens
- Computational Experience with the Molecular Distance Geometry Problem
- A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems
- The discretizable molecular distance geometry problem
This page was built for publication: On generating instances for the modular distance geometry problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492539)
