Distance geometry with and without the graph - Laboratoire d'informatique de l'X (LIX)
Book Sections Year : 2024

Distance geometry with and without the graph

Leo Liberti

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.

Fichier principal
Vignette du fichier
fields_survey_dgp.pdf (2.64 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04747403 , version 1 (22-10-2024)

Licence

Identifiers

Cite

Leo Liberti, Carlile Lavor. Distance geometry with and without the graph. Geometric Constraint Systems: Problems, Progress, Connections, and Emerging Applications, In press. ⟨hal-04747403⟩
0 View
0 Download

Altmetric

Share

More