Mathematical Programming Models
Mathematical Programming Models is a formal optimization framework belonging to the class of mathematical models that uses algebraic representations of objectives and constraints to systematically allocate resources and support decision-making under limitations, distinguished by its reliance on mathematical programming techniques such as linear, integer, or nonlinear programming.
4.2K
Publications
268.3K
Citations
8.6K
Authors
2.5K
Institutions
Publications per year
2017–2026
891
Parents
4.2K
Nonlinear programming: theory and algorithms
Computers & Operations Research · 1993 · 5.8K citations
Raymond H. Myers, Douglas C. Montgomery · IIE Transactions · 1996 · 3.8K citations
Branch-and-Bound Methods: A Survey
Eugene L. Lawler, Derek Wood · Operations Research · 1966 · 2K citations
1–5 of 4.2K
8.6K
17
h-index
16
h-index
Universidad Michoacana de San Nicolás de Hidalgo, Mexico
17 publications · 711 citations
14
h-index
13
h-index
12
h-index
1–5 of 8.6K
2.5K
Carnegie Mellon University
Pittsburgh, United States
30 h-index
92 publications
25.8K citations
Purdue University West Lafayette
West Lafayette, United States
26 h-index
67 publications
5.1K citations
Politecnico di Milano
Milan, Italy
26 h-index
81 publications
3.6K citations

University of Tehran
Tehran, Iran
24 h-index
81 publications
2.5K citations
Massachusetts Institute of Technology
Cambridge, United States
24 h-index
45 publications
7.9K citations
University of California, Berkeley
Berkeley, United States
24 h-index
47 publications
3.1K citations

Centre National de la Recherche Scientifique
Paris, France
23 h-index
75 publications
2.3K citations
Stanford University
Stanford, United States
23 h-index
39 publications
6.1K citations
1–8 of 2.5K
88 publications · 29.5K citations
49
h-index
143 publications · 7.6K citations
47
h-index
83 publications · 7K citations
41
h-index
61 publications · 9.5K citations
37
h-index
72 publications · 4.2K citations
34
h-index
1–5