A cycle-based formulation for the distance geometry problem

  • Leo Liberti
  • , Gabriele Iommazzo
  • , Carlile Lavor
  • , Nelson Maculan

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

The distance geometry problem consists in finding a realization of a weighted 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.

Original languageEnglish
Title of host publicationAIRO Springer Series
PublisherSpringer Nature
Pages93-106
Number of pages14
DOIs
Publication statusPublished - 1 Jan 2021

Publication series

NameAIRO Springer Series
Volume5
ISSN (Print)2523-7047
ISSN (Electronic)2523-7055

Keywords

  • Cycle basis
  • Mathematical programming
  • Protein conformation

Fingerprint

Dive into the research topics of 'A cycle-based formulation for the distance geometry problem'. Together they form a unique fingerprint.

Cite this