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

DOI10.1007/S10898-007-9218-1MaRDI QIDQ1029680zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

smoothingglobal optimizationvariable neighbourhood searchdistance geometryglobal continuationmolecular conformation

Mathematics Subject Classification ID

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

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
• Publication:4414560
• A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
• Publication:4514007
• The discretizable molecular distance geometry problem
• Recent advances on the discretizable molecular distance geometry problem

Cites work

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

Cited in

(20)

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

Describes a project that uses

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)