Mixed-integer Nonlinear Programming
Mixed-Integer Nonlinear Programming is a mathematical optimization paradigm that combines the discrete decision-making of integer programming with the nonlinear functional relationships of nonlinear programming, distinguished by its simultaneous treatment of integer and continuous variables within nonlinear objective functions and constraints.
2K
Publications
112.2K
Citations
5K
Authors
1.4K
Institutions
Publications per year
2017–2026
945
Variants
Minlp
2K
An algorithmic framework for convex mixed integer nonlinear programs
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn et al. · Discrete Optimization · 2007 · 885 citations · Full text
1–5 of 2K
5K
32
h-index
16
h-index
15
h-index
12
h-index
12
h-index
1–5 of 5K
1.4K
Carnegie Mellon University
Pittsburgh, United States
39 h-index
134 publications
15.4K citations
Tsinghua University
Beijing, China
28 h-index
111 publications
8.9K citations

Imperial College London
London, United Kingdom
27 h-index
101 publications
4.7K citations

Beijing University of Posts and Telecommunications
Beijing, China
26 h-index
142 publications
7K citations

University of Waterloo
Waterloo, Canada
24 h-index
86 publications
10.8K citations
Massachusetts Institute of Technology
Cambridge, United States
24 h-index
50 publications
4.2K citations
Beijing Jiaotong University
Beijing, China
20 h-index
82 publications
2.9K citations
University of Wisconsin–Madison
Madison, United States
19 h-index
45 publications
2.9K citations
1–8 of 1.4K
77 publications · 11.1K citations
52
h-index
176 publications · 7.9K citations
49
h-index
58 publications · 4.4K citations
38
h-index
43 publications · 3.3K citations
31
h-index
32 publications · 3K citations
29
h-index
1–5