Linear Integer Optimization
Linear Integer Optimization is a mathematical optimization method that belongs to the class of linear programming problems, distinguished by the requirement that some or all variables must take integer values.
2.6K
Publications
138.8K
Citations
6.1K
Authors
1.7K
Institutions
Publications per year
2017–2026
840
Variants
Integer Linear ProgramLinear Integer ProgramLinear Integer Programming
Parents
2.6K
Branch-and-Bound Methods: A Survey
Eugene L. Lawler, Derek Wood · Operations Research · 1966 · 2K citations
Ulrik Brandes, Daniel Delling, Marco Gaertler et al. · IEEE Transactions on Knowledge and Data Engineering · 2008 · 1.3K citations · Full text
1–5 of 2.6K
6.1K
18
h-index
16
h-index
15
h-index
14
h-index
14
h-index
1–5 of 6.1K
1.7K

University of Waterloo
Waterloo, Canada
28 h-index
130 publications
8.8K citations
The University of Texas at Austin
Austin, United States
26 h-index
84 publications
4.6K citations
Massachusetts Institute of Technology
Cambridge, United States
26 h-index
57 publications
4.2K citations
Tsinghua University
Beijing, China
22 h-index
92 publications
4.9K citations

Centre National de la Recherche Scientifique
Paris, France
22 h-index
108 publications
2.9K citations
University of California, Davis
Davis, United States
22 h-index
64 publications
4.1K citations
Politecnico di Milano
Milan, Italy
21 h-index
58 publications
2.5K citations

University of Hong Kong
Pok Fu Lam, Hong Kong
21 h-index
45 publications
2.2K citations
1–8 of 1.7K
51 publications · 2.3K citations
30
h-index
41 publications · 8.3K citations
30
h-index
37 publications · 4K citations
28
h-index
39 publications · 1.7K citations
27
h-index
39 publications · 1.2K citations
24
h-index
1–5