Convex Hull Optimization is a computational framework in computational geometry that specifically identifies and exploits the minimal convex set enclosing a given set of points to optimize extremal linear functionals over discrete or continuous domains.
273
Publications
18.7K
Citations
672
Authors
304
Institutions
Publications per year
2017–2026
66
Parents
Publications
273
The relationship between Precision-Recall and ROC curves
Jesse Davis, Mark Goadrich · 2006 · 6.3K citations · Full text
Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization
Martin Jaggi · 2013 · 898 citations · Full text
An optimal convex hull algorithm in any fixed dimension
Bernard Chazelle · Discrete & Computational Geometry · 1993 · 364 citations · Full text
1–5 of 273
Authors
672
- PB
7
h-index
- MA
5
h-index
- TZ
5
h-index
- BY
4
h-index
- PB
4
h-index
1–5 of 672
Institutions
304
University of Connecticut
Storrs, United States
7 h-index
17 publications
430 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
11 publications
926 citations
Tsinghua University
Beijing, China
7 h-index
14 publications
447 citations
University of Florida
Gainesville, United States
6 h-index
14 publications
405 citations
Hungarian Academy of Sciences
Budapest, Hungary
5 h-index
9 publications
232 citations
Pennsylvania State University
State College, United States
5 h-index
7 publications
189 citations
Stanford University
Stanford, United States
5 h-index
12 publications
442 citations
HUN-REN Institute for Computer Science and Control
Budapest, Hungary
5 h-index
10 publications
219 citations
1–8 of 304
Venues
- Operations Research
9 publications · 886 citations
9
h-index
- IEEE Transactions on Power Systems
8 publications · 331 citations
8
h-index
- Information Processing Letters
5 publications · 273 citations
5
h-index
- Annals of Operations Research
5 publications · 190 citations
5
h-index
- arXiv (Cornell University)
Repository · 4 publications · 126 citations
4
h-index
1–5