On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 322-342
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Recent advances on the Discretizable Molecular Distance Geometry ProblemEuropean Journal of Operational Research, 2012
- The discretizable molecular distance geometry problemComputational Optimization and Applications, 2011
- Molecular distance geometry methods: from continuous to discreteInternational Transactions in Operational Research, 2010
- On the computation of protein backbones by using artificial backbones of hydrogensJournal of Global Optimization, 2010
- Explicit Sensor Network Localization using Semidefinite Representations and Facial ReductionsSIAM Journal on Optimization, 2010
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry ProblemInternational Transactions in Operational Research, 2008
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problemJournal of Heuristics, 2007
- On Products of Euclidean ReflectionsThe American Mathematical Monthly, 2006
- Generic Global RigidityDiscrete & Computational Geometry, 2004
- The Molecule Problem: Exploiting Structure in Global OptimizationSIAM Journal on Optimization, 1995