Pages that link to "Item:Q1926903"
From MaRDI portal
The following pages link to Local search based heuristics for global optimization: atomic clusters and beyond (Q1926903):
Displaying 13 items.
- An iterated local search algorithm for a place scheduling problem (Q474475) (← links)
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters (Q1415484) (← links)
- Basin hopping networks of continuous global optimization problems (Q1642814) (← links)
- Basin hopping with synched multi L-BFGS local searches. Parallel implementation in multi-CPU and GPUs (Q2009548) (← links)
- Hopping between distant basins (Q2079697) (← links)
- Dissimilarity measures for population-based global optimization algorithms (Q2379686) (← links)
- Linear scaling and the DIRECT algorithm (Q2392126) (← links)
- Modified DIRECT Algorithm for Scaled Global Optimization Problems (Q2942499) (← links)
- An algorithm based on Wang-Landau sampling for finding the global minimum of atomic clusters (Q3013451) (← links)
- Clustering methods for large scale geometrical global optimization (Q5198058) (← links)
- (Q5237815) (← links)
- Global optimization based on local searches (Q5920293) (← links)
- Global optimization based on local searches (Q5925165) (← links)