Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Double variable neighbourhood search with smoothing for the molecular distance geometry problem|
|Abstract:||We discuss the geometrical interpretation of a well-known smoothing operator applied to the Molecular Distance Geometry Problem (MDGP), and we then describe a heuristic approach based on Variable Neighbourhood Search on the smoothed and original problem. This algorithm often manages to find solutions having higher accuracy than other methods. This is important as small differences in the objective function value may point to completely different 3D molecular structures.|
Variable neighbourhood search
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.