Quadratic Programming Relaxations is a mathematical optimization technique that belongs to the class of relaxation methods, specifically characterized by approximating a constrained quadratic programming problem through a simpler formulation with relaxed constraints to facilitate efficient computation of near-optimal solutions.
524
Publications
36.5K
Citations
975
Authors
485
Institutions
Publications per year
2017–2026
85
Parents
Publications
524
1–5 of 524
Authors
975
- HW
10
h-index
- DL
8
h-index
- FR
8
h-index
- KM
7
h-index
- SZ
7
h-index
1–5 of 975
Institutions
485
University of Iowa
Iowa City, United States
16 h-index
22 publications
1.9K citations
Carnegie Mellon University
Pittsburgh, United States
15 h-index
28 publications
2.7K citations
Princeton University
Princeton, United States
14 h-index
26 publications
8K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
14 h-index
19 publications
1.2K citations
University of Waterloo
Waterloo, Canada
12 h-index
17 publications
1.1K citations
Management Sciences (United States)
Albuquerque, United States
12 h-index
11 publications
1.2K citations
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
16 publications
538 citations
Chinese Academy of Sciences
Beijing, China
9 h-index
10 publications
581 citations
1–8 of 485
Venues
- Mathematical Programming
66 publications · 7.1K citations
39
h-index
- Journal of Global Optimization
30 publications · 1.9K citations
21
h-index
- European Journal of Operational Research
21 publications · 890 citations
17
h-index
- SIAM Journal on Optimization
15 publications · 1.2K citations
15
h-index
- Computational Optimization and Applications
15 publications · 533 citations
14
h-index
1–5