| An improved definition of proper efficiency for vector maximization with respect to cones HP Benson Journal of mathematical analysis and applications 71 (1), 232-241, 1979 | 427 | 1979 |
| An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem HP Benson Journal of Global Optimization 13, 1-24, 1998 | 285 | 1998 |
| Existence of efficient solutions for vector maximization problems HP Benson Journal of Optimization Theory and Applications 26, 569-580, 1978 | 237 | 1978 |
| Optimization over the efficient set HP Benson Journal of Mathematical Analysis and Applications 98 (2), 562-580, 1984 | 205 | 1984 |
| Concave minimization: theory, applications and algorithms HP Benson Handbook of global optimization, 43-148, 1995 | 183 | 1995 |
| The vector maximization problem: proper efficiency and stability HP Benson, TL Morin SIAM Journal on Applied Mathematics 32 (1), 64-72, 1977 | 131 | 1977 |
| Global optimization algorithm for the nonlinear sum of ratios problem HP Benson Journal of Optimization Theory and Applications 112, 1-29, 2002 | 128* | 2002 |
| On the global optimization of sums of linear fractional functions over a convex set HP Benson Journal of Optimization Theory and Applications 121, 19-39, 2004 | 117 | 2004 |
| A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set HP Benson Journal of Optimization Theory and Applications 73, 47-64, 1992 | 117 | 1992 |
| An all-linear programming relaxation algorithm for optimizing over the efficient set HP Benson Journal of Global Optimization 1, 83-104, 1991 | 116 | 1991 |
| Towards finding global representations of the efficient set in multiple objective mathematical programming HP Benson, S Sayin Naval Research Logistics (NRL) 44 (1), 47-67, 1997 | 110 | 1997 |
| Using concave envelopes to globally solve the nonlinear sum of ratios problem HP Benson Journal of Global Optimization 22 (1), 343-364, 2002 | 103 | 2002 |
| Vector maximization with two objective functions HP Benson Journal of Optimization Theory and Applications 28, 253-257, 1979 | 93 | 1979 |
| A finite algorithm for concave minimization over a polyhedron HP Benson Naval Research Logistics Quarterly 32 (1), 165-177, 1985 | 85 | 1985 |
| Outcome-space cutting-plane algorithm for linear multiplicative programming HP Benson, GM Boger Journal of Optimization Theory and Applications 104, 301-322, 2000 | 83 | 2000 |
| Deterministic algorithms for constrained concave minimization: A unified critical survey HP Benson Naval Research Logistics (NRL) 43 (6), 765-795, 1996 | 83 | 1996 |
| Outcome space partition of the weight set in multiobjective linear programming HP Benson, E Sun Journal of Optimization Theory and Applications 105, 17-36, 2000 | 80 | 2000 |
| Multiplicative programming problems: analysis and efficient point search heuristic HP Benson, GM Boger Journal of Optimization Theory and Applications 94, 487-510, 1997 | 80 | 1997 |
| Concave minimization via conical partitions and polyhedral outer approximation R Horst, NV Thoai, HP Benson Mathematical Programming 50, 259-274, 1991 | 77 | 1991 |
| Fractional programming with convex quadratic forms and functions HP Benson European Journal of Operational Research 173 (2), 351-369, 2006 | 71 | 2006 |
