A cycle-based formulation for the distance geometry problem

DOI10.1007/978-3-030-63072-0_8MaRDI QIDQ2056892zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cycle basismathematical programmingprotein conformation

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(6)

• Maximum feasible subsystems of distance geometry constraints
• Diagonally dominant programming in distance geometry
• Distance geometry on the sphere
• Improved Distance Queries and Cycle Counting by Frobenius Normal Form
• The Euclidean distance completion problem: cycle completability
• 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)