Double variable neighbourhood search with smoothing for the molecular distance geometry problem

DOI10.1007/S10898-007-9218-1zbMATH Open1169.90470OpenAlexW2034307786WikidataQ62562202 ScholiaQ62562202MaRDI QIDQ1029680FDOQ1029680

Authors: Leo Liberti, Fabrizio Marinelli, Carlile Lavor, Nelson Maculan 

Publication date: 13 July 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-007-9218-1

Recommendations

• Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
• Solving molecular distance geometry problems by global optimization algorithms
• Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
• Extending the geometric build-up algorithm for the molecular distance geometry problem
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• scientific article; zbMATH DE number 1953154
• A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
• scientific article; zbMATH DE number 1531961
• The discretizable molecular distance geometry problem
• Recent advances on the discretizable molecular distance geometry problem

zbMATH Keywords

smoothingglobal optimizationvariable neighbourhood searchdistance geometryglobal continuationmolecular conformation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
• Global optimization. From theory to implementation.
• Global Continuation for Distance Geometry Problems
• On generating instances for the modular distance geometry problem
• A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
• Computational Experience with the Molecular Distance Geometry Problem
• Distance geometry optimization for protein structures
• Title not available (Why is that?)

Cited In (20)

• A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
• Recent advances on the interval distance geometry problem
• Hyperbolic smoothing and penalty techniques applied to molecular structure determination
• Computational experience with an algorithm for tetrangle inequality bound smoothing
• Variable neighbourhood search: Methods and applications
• The discretizable molecular distance geometry problem
• Molecular distance geometry methods: from continuous to discrete
• On the computation of protein backbones by using artificial backbones of hydrogens
• Variable neighbourhood search: methods and applications
• Variable neighborhood search: basics and variants
• A recipe for finding good solutions to MINLPs
• Global optimization based on local searches
• Global optimization based on local searches
• Distance geometry on the sphere
• Maxent-stress optimization of 3D biomolecular models
• Recent advances on the discretizable molecular distance geometry problem
• Cycle-based formulations in distance geometry
• On convex relaxations of quadrilinear terms
• The discretizable distance geometry problem
• A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments

Uses Software

• SNOPT

This page was built for publication: Double variable neighbourhood search with smoothing for the molecular distance geometry problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029680)