Global Optimization Of Quadratic Programs
Global Optimization of Quadratic Programs is a mathematical optimization framework that belongs to the class of deterministic methods for solving non-convex quadratic programming problems, distinguished by its focus on identifying globally optimal solutions rather than local optima through rigorous bounding, branching, or reformulation techniques.
111
Publications
5K
Citations
211
Authors
139
Institutions
Publications per year
2017–2026
18
Parents
111
Continuous Characterizations of the Maximum Clique Problem
L. Gibbons, Donald W. Hearn, Pãnos M. Pardalos et al. · Mathematics of Operations Research · 1997 · 160 citations
1–5 of 111
211
9
h-index
6
h-index
Institut National des Sciences Appliquées Rouen Normandie, France
5 publications · 254 citations
5
h-index
5
h-index
4
h-index
1–5 of 211
139

Pennsylvania State University
State College, United States
7 h-index
9 publications
504 citations
University of Florida
Gainesville, United States
6 h-index
12 publications
1.3K citations

UNSW Sydney
Sydney, Australia
6 h-index
8 publications
288 citations

University of Minnesota
Minneapolis, United States
6 h-index
9 publications
549 citations

Institut National des Sciences Appliquées Rouen Normandie
Saint-Étienne-du-Rouvray, France
5 h-index
11 publications
499 citations

Federation University
Ballarat, Australia
4 h-index
4 publications
186 citations

Chongqing Normal University
Chongqing, China
3 h-index
3 publications
165 citations
University of Vienna
Vienna, Austria
3 h-index
5 publications
118 citations
1–8 of 139
8 publications · 244 citations
8
h-index
8 publications · 482 citations
8
h-index
8 publications · 490 citations
8
h-index
6 publications · 201 citations
6
h-index
4 publications · 103 citations
4
h-index
1–5