Distance geometry with and without the graph
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913557209153536 |
|---|---|
| author | Liberti, Leo Lavor, Carlile |
| author_facet | Liberti, Leo Lavor, Carlile |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_15677 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Distance geometry with and without the graph Liberti, Leo Lavor, Carlile Optimization and Control Metric Geometry 90C26, 51K05 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. |
| title | Distance geometry with and without the graph |
| topic | Optimization and Control Metric Geometry 90C26, 51K05 |
| url | https://arxiv.org/abs/2410.15677 |