The discretizable distance geometry problem
type: Item
instance of: scholarly article
title: The discretizable distance geometry problem
zbMATH Open document ID: 1258.90100
author: Leo Liberti
author: Antonio Mucherino
author: Carlile Lavor
published in: Optimization Letters
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6119191
zbMATH Keywords: distance geometry
zbMATH Keywords: DDGP\(_3\)
zbMATH Keywords: DMDGP
zbMATH Keywords: combinatorial reformulations
zbMATH Keywords: branch and prune
describes a project that uses: MD-jeep
describes a project that uses: LAPACK
MaRDI profile type: Publication
full work available at URL: s11590-011-0358-3
OpenAlex ID: W2049815112
Wikidata QID: Q62562163
cites work: Extending the geometric build-up algorithm for the molecular distance geometry problem
cites work: Reliable computation of the points of intersection of \(n\) spheres in \({\mathbb{R}}^n\)
cites work: Q5461825
cites work: Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
cites work: Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
cites work: Discretization orders for distance geometry problems
cites work: Computational Experience with the Molecular Distance Geometry Problem
cites work: Double variable neighbourhood search with smoothing for the molecular distance geometry problem
cites work: The discretizable molecular distance geometry problem
cites work: Recent advances on the discretizable molecular distance geometry problem
cites work: On the computation of protein backbones by using artificial backbones of hydrogens
cites work: A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
cites work: The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins
cites work: Molecular distance geometry methods: from continuous to discrete
cites work: Q3840334
cites work: Global Continuation for Distance Geometry Problems
cites work: Distance geometry optimization for protein structures
cites work: The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
cites work: Q3565732
cites work: MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems
cites work: Q4861402
cites work: Theory of semidefinite programming for sensor network localization
cites work: An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
cites work: Rigid versus unique determination of protein structures with geometric buildup
DOI: 10.1007/S11590-011-0358-3
DBLP publication ID: journals/ol/MucherinoLL12
description: scientific article; zbMATH DE number 6119191