Discretization orders for distance geometry problems
type: Item
instance of: scholarly article
title: Discretization orders for distance geometry problems
zbMATH Open document ID: 1258.90096
author: Jon Lee
author: Audrey Lee-St. John
author: Leo Liberti
author: Carlile Lavor
published in: Optimization Letters
publication date: 2012-11-30T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6111737
zbMATH Keywords: molecular distance geometry
zbMATH Keywords: proteins
zbMATH Keywords: sensor network localization
zbMATH Keywords: graph drawing
describes a project that uses: CPLEX
describes a project that uses: AMPL
MaRDI profile type: Publication
full work available at URL: s11590-011-0302-6
OpenAlex ID: W2034762747
Wikidata QID: Q62562159
cites work: Q5818996
cites work: Extending the geometric build-up algorithm for the molecular distance geometry problem
cites work: A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
cites work: Q4370897
cites work: A multivariate partition approach to optimization problems
cites work: Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
cites work: Computational Experience with the Molecular Distance Geometry Problem
cites work: The discretizable molecular distance geometry problem
cites work: Q3565732
cites work: On the computation of protein backbones by using artificial backbones of hydrogens
cites work: Recent advances on the discretizable molecular distance geometry problem
cites work: A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
cites work: Molecular distance geometry methods: from continuous to discrete
cites work: On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem
cites work: Global Continuation for Distance Geometry Problems
cites work: The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
cites work: The discretizable distance geometry problem
cites work: Q3840334
cites work: Q4861402
cites work: Experimental and Efficient Algorithms
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-0302-6
description: scientific article; zbMATH DE number 6111737