Convex Sets
Convex Sets is a mathematical construct in which a subset of a vector space is characterized by the property that for any two points within the set, the line segment connecting them lies entirely within the set.
3K
Publications
177.9K
Citations
4.4K
Authors
1.5K
Institutions
Publications per year
2017–2026
338
3K
Decomposition Principle for Linear Programs
George B. Dantzig, Philip Wolfe · Operations Research · 1960 · 2.3K citations
1–5 of 3K
4.4K
15
h-index
15
h-index
12
h-index
12
h-index
12
h-index
1–5 of 4.4K
1.5K
Massachusetts Institute of Technology
Cambridge, United States
29 h-index
64 publications
10.8K citations
Princeton University
Princeton, United States
25 h-index
41 publications
11.5K citations

Centre National de la Recherche Scientifique
Paris, France
25 h-index
83 publications
2.9K citations
University of Illinois Urbana-Champaign
Urbana, United States
23 h-index
57 publications
9K citations
Carnegie Mellon University
Pittsburgh, United States
23 h-index
51 publications
3.4K citations
University of Washington
Seattle, United States
23 h-index
54 publications
3.2K citations
University of California, Berkeley
Berkeley, United States
22 h-index
58 publications
4.6K citations
Stanford University
Stanford, United States
21 h-index
41 publications
4K citations
1–8 of 1.5K
104 publications · 7.2K citations
39
h-index
PROC · 124 publications · 4.6K citations
35
h-index
TRAN · 74 publications · 3.9K citations
32
h-index
52 publications · 5K citations
30
h-index
38 publications · 7.1K citations
27
h-index
1–5