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

DOI10.1007/s10898-007-9218-1zbMath1169.90470OpenAlexW2034307786WikidataQ62562202 ScholiaQ62562202MaRDI QIDQ1029680

Fabrizio Marinelli, Leo Liberti, Carlile C. Lavor, Nelson F. 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

global optimizationsmoothingdistance geometrymolecular conformationvariable neighbourhood searchglobal continuation

Mathematics Subject Classification ID

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

Related Items

A recipe for finding good solutions to MINLPs, The discretizable distance geometry problem, Recent advances on the discretizable molecular distance geometry problem, Recent advances on the interval distance geometry problem, Hyperbolic smoothing and penalty techniques applied to molecular structure determination, Cycle-based formulations in distance geometry, Distance Geometry on the Sphere, Variable neighborhood search: basics and variants, On convex relaxations of quadrilinear terms, The discretizable molecular distance geometry problem, On the computation of protein backbones by using artificial backbones of hydrogens, Variable neighbourhood search: methods and applications, Unnamed Item, Molecular distance geometry methods: from continuous to discrete, Global optimization based on local searches, Global optimization based on local searches, Variable neighbourhood search: Methods and applications, A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments

Uses Software

• SNOPT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• Global optimization. From theory to implementation.
• Distance geometry optimization for protein structures
• A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
• Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
• Global Continuation for Distance Geometry Problems
• Computational Experience with the Molecular Distance Geometry Problem