Computational Experience with the Molecular Distance Geometry Problem
From MaRDI portal
Publication:5427980
DOI10.1007/0-387-30927-6_9zbMath1129.90389OpenAlexW1596630133MaRDI QIDQ5427980
Leo Liberti, Nelson F. Maculan, Carlile C. Lavor
Publication date: 27 November 2007
Published in: Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/0-387-30927-6_9
global optimizationdistance geometrymolecular conformationvariable neighbourhood searchmulti-level single linkagespatial branch-and-bound
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Classical flows, reactions, etc. in chemistry (92E20)
Related Items
Maximum feasible subsystems of distance geometry constraints, Deterministic global optimization in ab-initio quantum chemistry, A multiplicative weights update algorithm for MINLP, A recipe for finding good solutions to MINLPs, The discretizable distance geometry problem, Recent advances on the discretizable molecular distance geometry problem, Clifford algebra and the discretizable molecular distance geometry problem, A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem, Distance geometry and data science, Cycle-based formulations in distance geometry, Benchmarking nonlinear optimization software in technical computing environments, On convex relaxations of quadrilinear terms, Minimal NMR distance information for rigidity of protein graphs, On the optimality of finding DMDGP symmetries, Preface: Special issue dedicated to distance geometry, Discretization orders for distance geometry problems, The discretizable molecular distance geometry problem, On the computation of protein backbones by using artificial backbones of hydrogens, Extending the geometric build-up algorithm for the molecular distance geometry problem, Preface, Double variable neighbourhood search with smoothing for the molecular distance geometry problem, Diagonally Dominant Programming in Distance Geometry, Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis, A quantum approach to the discretizable molecular distance geometry problem
Uses Software
