Linear Programming Relaxations
Linear Programming Relaxation is a mathematical optimization technique that belongs to the class of relaxation methods, distinguished by its transformation of an integer programming problem into a linear programming problem through the removal of integrality constraints on the variables.
1.1K
Publications
90.3K
Citations
1.9K
Authors
727
Institutions
Publications per year
2017–2026
141
Variants
Lp Relaxations
1.1K
1–5 of 1.1K
1.9K
14
h-index
9
h-index
7
h-index
Laboratoire d'Analyse et d'Architecture des Systèmes, France
7 publications · 855 citations
7
h-index
7
h-index
1–5 of 1.9K
727
Massachusetts Institute of Technology
Cambridge, United States
23 h-index
57 publications
5K citations
Carnegie Mellon University
Pittsburgh, United States
22 h-index
46 publications
3K citations
Georgia Institute of Technology
Atlanta, United States
17 h-index
30 publications
2.7K citations

Cornell University
Ithaca, United States
15 h-index
29 publications
3.1K citations
University of California, Berkeley
Berkeley, United States
15 h-index
28 publications
2.2K citations
Virginia Tech
Blacksburg, United States
15 h-index
18 publications
1.6K citations
Stanford University
Stanford, United States
14 h-index
23 publications
1.5K citations
Princeton University
Princeton, United States
14 h-index
27 publications
1.9K citations
1–8 of 727
81 publications · 8.5K citations
40
h-index
32 publications · 4.9K citations
27
h-index
46 publications · 2.8K citations
26
h-index
OR · 31 publications · 11.3K citations
20
h-index
32 publications · 1.2K citations
19
h-index
1–5