Solving molecular distance geometry problems by global optimization algorithms (Q842778): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5461825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization of Morse Clusters by Potential Energy Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A population-based approach for hard global optimization problems based on dissimilarity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental analysis of a population based approach for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optima of Lennard-Jones clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization on funneling landscapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for large scale global optimization: Lennard-Jones clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multilevel structure of global optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Continuation for Distance Geometry Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance geometry optimization for protein structures / rank
 
Normal rank

Latest revision as of 23:30, 1 July 2024

scientific article
Language Label Description Also known as
English
Solving molecular distance geometry problems by global optimization algorithms
scientific article

    Statements

    Identifiers