Extreme Point Computation

Extreme Point Computation is a methodological framework in computational geometry that identifies the minimal set of vertices forming the convex hull of a finite point set by determining those points that cannot be expressed as convex combinations of others.

276

Publications

13.8K

Citations

475

Authors

269

Institutions

Publications per year

2017–2026

24

Authors

475

  1. HP
    Harold P. Benson

    University of Florida, United States

    6 publications · 257 citations

    6

    h-index

  2. TM
    Timothy M. Chan

    University of Waterloo, Canada

    6 publications · 260 citations

    6

    h-index

  3. RE
    Ralph E. Steuer

    University of Georgia, United States

    5 publications · 321 citations

    5

    h-index

  4. HD
    Hanif D. Sherali

    Virginia Tech, United States

    4 publications · 80 citations

    4

    h-index

  5. YG
    Yu. G. Stoyan

    National Academy of Sciences of Ukraine, Ukraine

    3 publications · 167 citations

    3

    h-index

1–5 of 475

Venues

  1. Proceedings of the American Mathematical Society

    PROC · 12 publications · 218 citations

    10

    h-index

  2. Operations Research

    9 publications · 845 citations

    9

    h-index

  3. Management Science

    9 publications · 843 citations

    9

    h-index

  4. Mathematical Programming

    8 publications · 497 citations

    8

    h-index

  5. European Journal of Operational Research

    8 publications · 244 citations

    8

    h-index

1–5