Distance Geometry in Linearizable Norms - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2017

Distance Geometry in Linearizable Norms

Résumé

Distance Geometry puts the concept of distance at its center. The basic problem in distance geometry could be described as drawing an edge-weighted undirected graph in R K for some given K such that the positions for adjacent vertices have distance which is equal to the corresponding edge weight. As we are unaware of any work in this field using any other norm but 2, we move some first steps using the 1 and ∞ norms: we discuss worst-case complexity, propose mixed-integer linear programming formulations, and sketch a few heuristic ideas.
Fichier principal
Vignette du fichier
gsi17.pdf (334.81 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02105291 , version 1 (20-04-2019)

Identifiants

Citer

Claudia d'Ambrosio, Leo Liberti. Distance Geometry in Linearizable Norms. Geometric Science of Information Third International Conference, GSI 2017, Paris, France, November 7-9, 2017, Proceedings, pp.830-837, 2017, 978-3-319-68444-4. ⟨10.1007/978-3-319-68445-1_95⟩. ⟨hal-02105291⟩
47 Consultations
86 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More