Distance geometry with and without the graph

2024/10/21 by Liberti, Leo, Lavor, Carlile
#51K05 #90C26 #FOS: Mathematics #Metric Geometry (math.MG) #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.2410.15677

Abstract

We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as part of the input. While mathematical programming methods can solve large-scale distance geometry problems with adjacencies, they are severely challenged in the absence thereof.

Related

• Distance Geometry and Data Science
• Open research areas in distance geometry
• A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem
• An impossible utopia in distance geometry
• Distance Measures for Geometric Graphs