Polytope Enumeration
Polytope Enumeration is a computational method in discrete geometry that systematically generates and classifies all combinatorially distinct polytopes satisfying specified constraints, such as dimension, number of vertices, or facet structure.
178
Publications
9.3K
Citations
276
Authors
183
Institutions
Publications per year
2017–2026
14
Parents
178
Discrete Groups Generated by Reflections
H. S. M. Coxeter · Annals of Mathematics · 1934 · 463 citations
Finding the nearest point in A polytope
Philip Wolfe · Mathematical Programming · 1976 · 315 citations
1–5 of 178
276
5
h-index
4
h-index
Laboratoire Bordelais de Recherche en Informatique, France
4 publications · 375 citations
4
h-index
4
h-index
4
h-index
1–5 of 276
183
University of Washington
Seattle, United States
7 h-index
8 publications
287 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
5 h-index
6 publications
419 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
10 publications
183 citations

University of Waterloo
Waterloo, Canada
4 h-index
4 publications
109 citations
Université Libre de Bruxelles
Brussels, Belgium
4 h-index
8 publications
201 citations

University of Massachusetts Amherst
Amherst Center, United States
4 h-index
8 publications
3K citations
University of Michigan
Ann Arbor, United States
4 h-index
5 publications
565 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
4 h-index
11 publications
576 citations
1–8 of 183
14 publications · 770 citations
12
h-index
10 publications · 479 citations
10
h-index
8 publications · 265 citations
8
h-index
7 publications · 449 citations
7
h-index
5 publications · 86 citations
5
h-index
1–5