Mixed-integer Programming
Mixed-Integer Programming is a mathematical optimization paradigm within the class of constrained optimization problems in which some variables are restricted to integer values while others may take continuous values, distinguishing it from purely continuous or discrete optimization models by combining both variable types under linear or nonlinear constraints.
10.4K
Publications
510.9K
Citations
20.5K
Authors
3.6K
Institutions
Publications per year
2017–2026
4.9K
10.4K
1–5 of 10.4K
20.5K
49
h-index
Illinois Institute of Technology, United States
61 publications · 6.3K citations
45
h-index
34
h-index
30
h-index
28
h-index
1–5 of 20.5K
3.6K
Carnegie Mellon University
Pittsburgh, United States
73 h-index
340 publications
36.1K citations
Massachusetts Institute of Technology
Cambridge, United States
66 h-index
333 publications
27.7K citations
Tsinghua University
Beijing, China
66 h-index
559 publications
38.4K citations
Georgia Institute of Technology
Atlanta, United States
51 h-index
271 publications
18.7K citations

Illinois Institute of Technology
Chicago, United States
49 h-index
134 publications
12.6K citations

University of Waterloo
Waterloo, Canada
48 h-index
220 publications
25.4K citations

Imperial College London
London, United Kingdom
47 h-index
248 publications
15.8K citations
University of Castilla-La Mancha
Ciudad Real, Spain
46 h-index
155 publications
20.3K citations
1–8 of 3.6K
400 publications · 45.6K citations
118
h-index
185 publications · 20.2K citations
77
h-index
150 publications · 15.7K citations
71
h-index
349 publications · 17.1K citations
69
h-index
408 publications · 17.7K citations
69
h-index
1–5