A Cycle-Based Formulation for the Distance Geometry Problem

Leo Liberti (1) , Gabriele Iommazzo (1) , Carlile Lavor (2) , Nelson Maculan (3)

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
2 IMECC - Instituto de Matemática, Estatística e Computação Científica [Brésil]
3 OptimizE / COPPE-UFRJ - Otimização Multidisciplinar em Engenharia

The distance geometry problem consists in finding a realization of a weighed graph in a Euclidean space of given dimension, where the edges are realized as straight segments of length equal to the edge weight. We propose and test a new mathematical programming formulation based on the incidence between cycles and edges in the given graph

Domaines: Recherche opérationnelle [math.OC]

Leo Liberti, Gabriele Iommazzo, Carlile Lavor, Nelson Maculan. A Cycle-Based Formulation for the Distance Geometry Problem. Graphs and Combinatorial Optimization: from Theory to Applications, pp.93-106, 2021, ⟨10.1007/978-3-030-63072-0_8⟩. ⟨hal-03250704⟩