New methods for the Distance Geometry Problem

Given an integer K and a simple edge-weighted undirected graph G=(V,E), the Distance Geometry Problem questions the existence of a vertex realization function V→RK such that each vertex pair adjacent to an edge is placed at a distance which is equal to the edge weight. This problem has many applications to science and engineering, and many methods have been proposed to solve it. We propose some new formulation-based methods.