Benson's Algorithm

Benson's Algorithm is a computational method in multi-objective optimization that, as a variant of outer approximation algorithms, generates the Pareto frontier for linear vector optimization problems by iteratively refining a polyhedral approximation through dual simplex and cutting plane techniques.

19

Publications

1K

Citations

37

Authors

29

Institutions

Publications per year

2017–2026

3

Authors

37

  1. LS
    Lizhen Shao

    University of Science and Technology Beijing, China

    4 publications · 211 citations

    4

    h-index

  2. ME
    Matthias Ehrgott

    University of Auckland, New Zealand

    4 publications · 211 citations

    4

    h-index

  3. AL
    Andreas Löhne

    Martin Luther University Halle-Wittenberg, Germany

    3 publications · 120 citations

    3

    h-index

  4. CA
    Christiane Aubry

    University of Ottawa, Canada

    2 publications · 108 citations

    2

    h-index

  5. BD
    Bryony DuPont

    Oregon State University, United States

    1 publications · 78 citations

    1

    h-index

1–5 of 37

Venues

  1. 3

    h-index

  2. Journal of Global Optimization

    3 publications · 215 citations

    3

    h-index

  3. The Journal of Physical Chemistry A

    2 publications · 108 citations

    2

    h-index

  4. Optimization

    2 publications · 41 citations

    2

    h-index

  5. Progress in Nuclear Energy

    1 publications · 78 citations

    1

    h-index

1–5