Integer Programming
Integer Programming is a mathematical optimization paradigm within the broader field of Operations Research that distinguishes itself by requiring some or all decision variables to take integer values, thereby modeling discrete decision-making scenarios.
22.4K
Publications
1.3M
Citations
32.9K
Authors
5.1K
Institutions
Publications per year
2017–2026
5.8K
Variants
Integer Optimization
22.4K
The Hungarian method for the assignment problem
Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations
Fred Glover · INFORMS Journal on Computing · 1990 · 5.6K citations
Linear and nonlinear programming.
Mathematics and Computers in Simulation · 1986 · 4.9K citations
1–5 of 22.4K
32.9K
59
h-index
Illinois Institute of Technology, United States
62 publications · 6.9K citations
49
h-index
47
h-index
46
h-index
42
h-index
1–5 of 32.9K
5.1K
Massachusetts Institute of Technology
Cambridge, United States
105 h-index
593 publications
57.5K citations
Carnegie Mellon University
Pittsburgh, United States
95 h-index
633 publications
53.2K citations
Georgia Institute of Technology
Atlanta, United States
87 h-index
571 publications
60.6K citations

University of Bologna
Bologna, Italy
82 h-index
396 publications
50.9K citations

Cornell University
Ithaca, United States
80 h-index
298 publications
38.2K citations
HEC Montréal
Montreal, Canada
73 h-index
260 publications
26.4K citations
Tsinghua University
Beijing, China
71 h-index
673 publications
39.1K citations
University of California, Berkeley
Berkeley, United States
66 h-index
290 publications
31.5K citations
1–8 of 5.1K
603 publications · 79.8K citations
146
h-index
1.3K publications · 89.5K citations
134
h-index
468 publications · 54.6K citations
123
h-index
576 publications · 54.4K citations
117
h-index
374 publications · 45.2K citations
110
h-index
1–5