On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1
From MaRDI portal
Publication:4609775
DOI10.1007/978-3-319-59861-1_8zbMath1384.90115OpenAlexW2694965191MaRDI QIDQ4609775
Publication date: 26 March 2018
Published in: Recent Advances in Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-59861-1_8
Related Items (2)
A study on the covalent geometry of proteins and its impact on distance geometry ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
Cites Work
- Unnamed Item
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- The discretizable molecular distance geometry problem
- Clifford algebra and the discretizable molecular distance geometry problem
- Recent advances on the interval distance geometry problem
- The discretizable distance geometry problem
- Essential order spectra of convolution operators
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Spheres Unions and Intersections and Some of their Applications in Molecular Modeling
- Distance Geometry
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Fundamental Limits on Synchronizing Clocks Over Networks
- Euclidean Distance Geometry and Applications
- Preface
This page was built for publication: On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1