A cycle-based formulation for the distance geometry problem

DOI10.1007/978-3-030-63072-0_8zbMATH Open1481.90305OpenAlexW3135846615MaRDI QIDQ2056892FDOQ2056892

Authors: Leo Liberti, Gabriele Iommazzo, Carlile Lavor, Nelson Maculan 

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-63072-0_8

Recommendations

• Cycle-based formulations in distance geometry
• New methods for the distance geometry problem
• Diagonally dominant programming in distance geometry
• Distance geometry in linearizable norms
• Feasibility check for the distance geometry problem: an application to molecular conformations

zbMATH Keywords

mathematical programmingcycle basisprotein conformation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Stochastic network models in operations research (90B15)

Cites Work

• Generic global rigidity
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Algorithms for Generating Fundamental Cycles in a Graph
• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Euclidean distance geometry and applications
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Title not available (Why is that?)
• Angular synchronization by eigenvectors and semidefinite programming
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• On minimal elementary bipartite graphs
• A greedy approach to compute a minimum cycle basis of a directed graph
• Recent advances on the discretizable molecular distance geometry problem
• Title not available (Why is that?)
• Molecular distance geometry methods: from continuous to discrete
• Counting the Number of Solutions of KDMDGP Instances
• New error measures and methods for realizing protein graphs from distance data
• An algorithm for finding a fundamental set of cycles of a graph
• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• Euclidean distance geometry. An introduction
• Open research areas in distance geometry
• A matroid view of key theorems for edge-swapping algorithms
• Is the distance geometry problem in NP?

Cited In (6)

• The Euclidean distance completion problem: cycle completability
• Diagonally dominant programming in distance geometry
• Maximum feasible subsystems of distance geometry constraints
• Improved Distance Queries and Cycle Counting by Frobenius Normal Form
• Distance geometry on the sphere
• Cycle-based formulations in distance geometry

This page was built for publication: A cycle-based formulation for the distance geometry problem

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