Combinatorial Optimization
Combinatorial Optimization is a branch of optimization that consists of finding an optimal object from a finite set of discrete possibilities, typically characterized by integer or binary variables and governed by combinatorial structures such as graphs, matroids, or permutations.
61.7K
Publications
3.9M
Citations
81.6K
Authors
8.6K
Institutions
Publications per year
2017–2026
17.2K
61.7K
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations
The Whale Optimization Algorithm
Seyedali Mirjalili, Andrew Lewis · Advances in Engineering Software · 2016 · 14K citations
The Hungarian method for the assignment problem
Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations
1–5 of 61.7K
81.6K
81
h-index
74
h-index
71
h-index
70
h-index
66
h-index
1–5 of 81.6K
8.6K
Massachusetts Institute of Technology
Cambridge, United States
132 h-index
982 publications
109.6K citations
Carnegie Mellon University
Pittsburgh, United States
122 h-index
1.1K publications
96K citations
University of California, Berkeley
Berkeley, United States
112 h-index
685 publications
75.9K citations
Georgia Institute of Technology
Atlanta, United States
107 h-index
943 publications
90.5K citations

Cornell University
Ithaca, United States
104 h-index
555 publications
58.8K citations
Tsinghua University
Beijing, China
104 h-index
1.4K publications
82.5K citations

Huazhong University of Science and Technology
Wuhan, China
103 h-index
1.5K publications
93.1K citations
HEC Montréal
Montreal, Canada
99 h-index
474 publications
50.2K citations
1–8 of 8.6K
2.5K publications · 185K citations
183
h-index
911 publications · 127.3K citations
175
h-index
534 publications · 71.6K citations
147
h-index
1.6K publications · 107.7K citations
147
h-index
717 publications · 71.3K citations
131
h-index
1–5