Pages that link to "Item:Q694593"
From MaRDI portal
The following pages link to The discretizable molecular distance geometry problem (Q694593):
Displaying 17 items.
- Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach (Q2841709) (← links)
- Distance Geometry on the Sphere (Q2958102) (← links)
- Molecular distance geometry methods: from continuous to discrete (Q3087839) (← links)
- Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint (Q3304780) (← links)
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem (Q3502133) (← links)
- On a Relationship Between Graph Realizability and Distance Matrix Completion (Q4596149) (← links)
- A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN (Q4608951) (← links)
- On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1 (Q4609775) (← links)
- Feasibility check for the distance geometry problem: an application to molecular conformations (Q5364068) (← links)
- Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance (Q5364201) (← links)
- (Q5461825) (← links)
- MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems (Q5747881) (← links)
- Constraint programming approaches for the discretizable molecular distance geometry problem (Q6065908) (← links)
- On distance graph coloring problems (Q6070499) (← links)
- Cycle-based formulations in distance geometry (Q6114894) (← links)
- A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems (Q6155061) (← links)
- An impossible combinatorial counting method in distance geometry (Q6558675) (← links)
