Discrete Optimization
Discrete Optimization is a branch of optimization that focuses on finding optimal solutions to problems where the set of feasible solutions is discrete or can be reduced to a discrete set, distinguishing it from continuous optimization by its reliance on combinatorial structures and finite solution spaces.
7.8K
Publications
545.2K
Citations
12.7K
Authors
2.9K
Institutions
Publications per year
2017–2026
1.8K
7.8K
1–5 of 7.8K
12.7K
34
h-index
29
h-index
26
h-index
24
h-index
23
h-index
1–5 of 12.7K
2.9K
Massachusetts Institute of Technology
Cambridge, United States
65 h-index
224 publications
30.1K citations
Carnegie Mellon University
Pittsburgh, United States
60 h-index
262 publications
23.7K citations
Georgia Institute of Technology
Atlanta, United States
59 h-index
259 publications
38.5K citations
University of California, Berkeley
Berkeley, United States
43 h-index
144 publications
11K citations

Cornell University
Ithaca, United States
40 h-index
121 publications
10.3K citations

University of Bologna
Bologna, Italy
37 h-index
122 publications
21.3K citations

Centre National de la Recherche Scientifique
Paris, France
37 h-index
194 publications
8.1K citations
Tsinghua University
Beijing, China
36 h-index
145 publications
6.6K citations
1–8 of 2.9K
254 publications · 35.4K citations
88
h-index
224 publications · 26K citations
77
h-index
145 publications · 16.6K citations
69
h-index
289 publications · 17.4K citations
64
h-index
123 publications · 16.2K citations
64
h-index
1–5