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
Parents
19
Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy
Timothy C. Y. Chan, Tim Craig, Taewoo Lee et al. · Operations Research · 2014 · 124 citations · Full text
1–5 of 19
37
4
h-index
4
h-index
3
h-index
2
h-index
1
h-index
1–5 of 37
29

University of Science and Technology Beijing
Beijing, China
3 h-index
3 publications
188 citations

Inner Mongolia University
Hohhot, China
2 h-index
2 publications
144 citations
Academy of Mathematics and Systems Science
Beijing, China
2 h-index
2 publications
71 citations
Martin Luther University Halle-Wittenberg
Halle, Germany
2 h-index
2 publications
128 citations

University of Ottawa
Ottawa, Canada
2 h-index
4 publications
216 citations

University of Auckland
Auckland, New Zealand
2 h-index
2 publications
162 citations
University of Southampton
Southampton, United Kingdom
1 h-index
2 publications
44 citations

Universidade Federal da Bahia
Salvador, Brazil
1 h-index
1 publications
69 citations
1–8 of 29
3 publications · 196 citations
3
h-index
3 publications · 215 citations
3
h-index
2 publications · 108 citations
2
h-index
2 publications · 41 citations
2
h-index
1 publications · 78 citations
1
h-index
1–5