The Distance Geometry Problem in three dimensions consists in finding an embedding in <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${\mathbb{R}^3}$$</EquationSource> </InlineEquation> of a given nonnegatively weighted simple undirected graph such that edge weights are equal to the corresponding Euclidean distances in the embedding. This is a continuous search problem...</equationsource></inlineequation>