Constraint programming approaches for the discretizable molecular distance geometry problem

DOI10.1002/net.22068arXiv1908.00048OpenAlexW3191986979MaRDI QIDQ6065908

Moira MacNeil, Merve Bodur

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.00048

zbMATH Keywords

combinatorial optimizationconstraint programmingdiscretization ordercontiguous trilateration orderingdiscretizable molecular distance geometry

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
• Discretization vertex orders in distance geometry
• Discretization orders for distance geometry problems
• The discretizable molecular distance geometry problem
• Recent advances on the interval distance geometry problem
• The discretizable distance geometry problem
• An integer programming approach for the search of discretization orders in distance geometry problems
• On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
• Optimal partial discretization orders for discretizable distance geometry
• An Introduction to Distance Geometry applied to Molecular Geometry
• Euclidean Distance Geometry and Applications

This page was built for publication: Constraint programming approaches for the discretizable molecular distance geometry problem