Hybrid Algorithms
Hybrid Algorithms is a computational methodology that integrates distinct algorithmic paradigms—such as exact, heuristic, and metaheuristic techniques in Job Shop Scheduling or combines numerical and approximation methods in N-Body Simulations—to leverage their complementary strengths and enhance overall solution accuracy, efficiency, or scalability.
1.6K
Publications
89.9K
Citations
4.2K
Authors
1.5K
Institutions
Publications per year
2017–2026
642
1.6K
A Survey of Collaborative Filtering Techniques
Xiaoyuan Su, Taghi M. Khoshgoftaar · Advances in Artificial Intelligence · 2009 · 3.6K citations · Full text
Markov Chains for Exploring Posterior Distributions
Luke Tierney · The Annals of Statistics · 1994 · 3.5K citations · Full text
Hybrid metaheuristics in combinatorial optimization: A survey
Christian Blum, Jakob Puchinger, Günther R. Raidl et al. · Applied Soft Computing · 2011 · 754 citations · Full text
1–5 of 1.6K
4.2K
21
h-index
19
h-index
18
h-index
17
h-index
14
h-index
1–5 of 4.2K
1.5K

Huazhong University of Science and Technology
Wuhan, China
35 h-index
133 publications
11.7K citations
Tsinghua University
Beijing, China
29 h-index
116 publications
8.7K citations
Liaocheng University
Liaocheng, China
23 h-index
62 publications
5.5K citations

University of Tehran
Tehran, Iran
19 h-index
49 publications
2.5K citations
Wuhan University of Technology
Wuhan, China
16 h-index
65 publications
4.1K citations

Northeastern University
Shenyang, China
16 h-index
31 publications
3.7K citations

Xi'an Jiaotong University
Xi'an, China
14 h-index
36 publications
3K citations

Centre National de la Recherche Scientifique
Paris, France
14 h-index
29 publications
899 citations
1–8 of 1.5K
47 publications · 5.6K citations
38
h-index
63 publications · 3.4K citations
38
h-index
40 publications · 4K citations
33
h-index
40 publications · 2.9K citations
32
h-index
28 publications · 3.3K citations
25
h-index
1–5