Mixed-integer Linear Programming
Mixed-Integer Linear Programming is a mathematical optimization problem in the class of linear programming models in which some, but not necessarily all, of the decision variables are required to take integer values.
5.3K
Publications
262.1K
Citations
11.6K
Authors
2.5K
Institutions
Publications per year
2017–2026
2.8K
Variants
MilpMixed-integer Linear Program
5.3K
Retiming synchronous circuitry
Charles E. Leiserson, James B. Saxe · Algorithmica · 1991 · 999 citations
1–5 of 5.3K
11.6K
31
h-index
Illinois Institute of Technology, United States
36 publications · 3.5K citations
30
h-index
24
h-index
22
h-index
22
h-index
1–5 of 11.6K
2.5K
Carnegie Mellon University
Pittsburgh, United States
47 h-index
146 publications
14.1K citations
Massachusetts Institute of Technology
Cambridge, United States
45 h-index
182 publications
18K citations
University of Castilla-La Mancha
Ciudad Real, Spain
45 h-index
133 publications
19.6K citations
Tsinghua University
Beijing, China
44 h-index
299 publications
22.1K citations

Imperial College London
London, United Kingdom
35 h-index
145 publications
9.6K citations

Sharif University of Technology
Tehran, Iran
33 h-index
122 publications
6.2K citations
Nanyang Technological University
Singapore, Singapore
33 h-index
108 publications
6.6K citations

Delft University of Technology
Delft, The Netherlands
33 h-index
150 publications
8.3K citations
1–8 of 2.5K
237 publications · 27.7K citations
94
h-index
125 publications · 14.8K citations
68
h-index
201 publications · 11.4K citations
59
h-index
201 publications · 8.5K citations
53
h-index
67 publications · 4.9K citations
38
h-index
1–5