Distance geometry in linearizable norms

DOI10.1007/978-3-319-68445-1_95MaRDI QIDQ1689240zbMATH OpenOpenAlexFDO

Authors Claudia D'Ambrosio, Leo Liberti

Publication date 12 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-68445-1_95

zbMATH Keywords

distance geometrymathematical programmingnorms

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62) General theory of distance geometry (51K05) Mixed integer programming (90C11) Measures of information, entropy (94A17)

Recommendations

• New methods for the distance geometry problem
• Euclidean distance geometry and applications
• On the exact solution of the distance geometry with interval distances in dimension 1
• Diagonally dominant programming in distance geometry
• Comments on: ``Distance geometry and data science

Cited in

(14)

• A cycle-based formulation for the distance geometry problem
• Distance geometry and data science
• Rejoinder on: ``Distance geometry and data science
• Rigidity of symmetric frameworks in normed spaces
• Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design
• Diagonally dominant programming in distance geometry
• Distance geometry on the sphere
• On the exact solution of the distance geometry with interval distances in dimension 1
• An alternative approach to distance geometry using \(L^\infty\) distances
• The Linearized Hellinger--Kantorovich Distance
• Comments on: ``Distance geometry and data science
• Cycle-based formulations in distance geometry
• A linear program for points of interest relocation in adaptive maps
• On distance-preserving transformations of lines in Euclidean three-space

This page was built for publication: Distance geometry in linearizable norms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689240)