Linear Programming
Linear Programming is a mathematical optimization technique that determines the best outcome in a given mathematical model characterized by linear relationships, specifically by maximizing or minimizing a linear objective function subject to a set of linear equality and inequality constraints.
14K
Publications
998.3K
Citations
18.1K
Authors
3.6K
Institutions
Publications per year
2017–2026
2.1K
Variants
Linear Optimization
14K
The Hungarian method for the assignment problem
Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations
1–5 of 14K
18.1K
37
h-index
34
h-index
34
h-index
32
h-index
32
h-index
1–5 of 18.1K
3.6K
Massachusetts Institute of Technology
Cambridge, United States
82 h-index
379 publications
56.2K citations
Stanford University
Stanford, United States
76 h-index
296 publications
67.2K citations
Carnegie Mellon University
Pittsburgh, United States
74 h-index
341 publications
30.9K citations
University of California, Berkeley
Berkeley, United States
70 h-index
287 publications
29.5K citations
Georgia Institute of Technology
Atlanta, United States
63 h-index
316 publications
34K citations

Cornell University
Ithaca, United States
58 h-index
211 publications
22K citations
Princeton University
Princeton, United States
57 h-index
177 publications
30.4K citations

University of Waterloo
Waterloo, Canada
55 h-index
200 publications
13.7K citations
1–8 of 3.6K
718 publications · 70.9K citations
129
h-index
337 publications · 52.6K citations
105
h-index
247 publications · 41.4K citations
92
h-index
610 publications · 35.5K citations
91
h-index
232 publications · 23.8K citations
84
h-index
1–5