Global Search Algorithms is a class of optimization algorithms designed to explore the entire search space systematically in order to identify the global optimum, distinguishing it from local search methods that may converge to suboptimal solutions.
3K
Publications
213.7K
Citations
8.1K
Authors
2.2K
Institutions
Publications per year
2017–2026
1.1K
Variants
Global Optimization Algorithms
Parents
Publications
3K
Search and clustering orders of magnitude faster than BLAST
R. C. Edgar · Bioinformatics · 2010 · 21.7K citations · Full text
1–5 of 3K
Authors
8.1K
- MA
20
h-index
- LA
19
h-index
- ZS
19
h-index
- CA
18
h-index
- FS
16
h-index
1–5 of 8.1K
Institutions
2.2K
Dalian University of Technology
Dalian, China
23 h-index
108 publications
8.3K citations
Centre National de la Recherche Scientifique
Paris, France
22 h-index
58 publications
2.3K citations
Chinese Academy of Sciences
Beijing, China
21 h-index
64 publications
2.3K citations
Princeton University
Princeton, United States
21 h-index
63 publications
9.6K citations
Xidian University
Xi'an, China
20 h-index
79 publications
4.5K citations
Imperial College London
London, United Kingdom
19 h-index
46 publications
5.2K citations
Universiti Sains Malaysia
George Town, Malaysia
19 h-index
33 publications
1.6K citations
Hazara University
Baffa, Pakistan
18 h-index
31 publications
1.8K citations
1–8 of 2.2K
Venues
- Journal of Global Optimization
93 publications · 6.5K citations
42
h-index
- IEEE Access
86 publications · 3.7K citations
34
h-index
- Applied Soft Computing
51 publications · 4.4K citations
33
h-index
- Expert Systems with Applications
40 publications · 4.8K citations
32
h-index
- Applied Mathematics and Computation
41 publications · 2.2K citations
28
h-index
1–5