Pages that link to "Item:Q1415484"
From MaRDI portal
The following pages link to Efficient algorithms for large scale global optimization: Lennard-Jones clusters (Q1415484):
Displaying 27 items.
- A nested heuristic for parameter tuning in support vector machines (Q336941) (← links)
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints (Q367165) (← links)
- A filling function method for unconstrained global optimization (Q493693) (← links)
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- The structure of atomic and molecular clusters, optimised using classical potentials (Q709966) (← links)
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems (Q727242) (← links)
- Solving molecular distance geometry problems by global optimization algorithms (Q842778) (← links)
- Newtonian clustering: an approach based on molecular dynamics and global optimization (Q877118) (← links)
- A population-based approach for hard global optimization problems based on dissimilarity measures (Q879969) (← links)
- Island models for cluster geometry optimization: how design options impact effectiveness and diversity (Q897050) (← links)
- An application of a global optimization parametrization method on macromolecular structure problem (Q990575) (← links)
- A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing (Q1319004) (← links)
- Improvement on the Northby algorithm for molecular conformation: Better solutions (Q1327431) (← links)
- Global optimization methods for high-dimensional problems (Q1806735) (← links)
- Local search based heuristics for global optimization: atomic clusters and beyond (Q1926903) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization (Q2397824) (← links)
- New results for molecular formation under pairwise potential minimization (Q2477013) (← links)
- An algorithm based on Wang-Landau sampling for finding the global minimum of atomic clusters (Q3013451) (← links)
- Global optimization of binary Lennard–Jones clusters (Q3396401) (← links)
- A stochastic algorithm for global optimization and for best populations: A test case of side chains in proteins (Q4547688) (← links)
- Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation (Q4608088) (← links)
- DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← links)
- Clustering methods for large scale geometrical global optimization (Q5198058) (← links)
- Fast global optimization of difficult Lennard-Jones clusters (Q5960291) (← links)
- Iterated dynamic neighborhood search for packing equal circles on a sphere (Q6164321) (← links)
- On the global minimum of the classical potential energy for clusters bound by many-body forces (Q6189794) (← links)
