Integer Linear Programming
Integer Linear Programming is a mathematical optimization method within the class of linear programming problems in which the decision variables are restricted to integer values, distinguishing it from standard linear programming by enforcing integrality constraints on variables to model discrete decision-making scenarios.
6.5K
Publications
331.3K
Citations
14.1K
Authors
2.9K
Institutions
Publications per year
2017–2026
2.6K
6.5K
Branch-and-Bound Methods: A Survey
Eugene L. Lawler, Derek Wood · Operations Research · 1966 · 2K citations
1–5 of 6.5K
14.1K
22
h-index
21
h-index
20
h-index
20
h-index
19
h-index
1–5 of 14.1K
2.9K
Carnegie Mellon University
Pittsburgh, United States
44 h-index
131 publications
11.1K citations
Tsinghua University
Beijing, China
41 h-index
302 publications
17.7K citations
Massachusetts Institute of Technology
Cambridge, United States
40 h-index
147 publications
11.6K citations

University of Waterloo
Waterloo, Canada
35 h-index
197 publications
13K citations
The University of Texas at Austin
Austin, United States
33 h-index
158 publications
8.7K citations

Centre National de la Recherche Scientifique
Paris, France
31 h-index
229 publications
6.4K citations
University of California, Berkeley
Berkeley, United States
31 h-index
97 publications
8.4K citations
Nanyang Technological University
Singapore, Singapore
30 h-index
114 publications
5.9K citations
1–8 of 2.9K
167 publications · 20.7K citations
78
h-index
69 publications · 7.9K citations
48
h-index
81 publications · 14.9K citations
48
h-index
139 publications · 7.4K citations
47
h-index
171 publications · 7.3K citations
47
h-index
1–5