Technical Note - On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint Coefficients. - S. Selçuk Erengüç; Harold P. Benson (Oper. Res., 1986)

An all-linear programming relaxation algorithm for optimizing over the efficient set. - Harold P. Benson (J. Glob. Optim., 1991)

Concave minimization via conical partitions and polyhedral outer approximation. - Reiner Horst; Nguyen V. Thoai; Harold P. Benson (Math. Program., 1991)

Complete efficiency and the initialization of algorithms for multiple objective programming. - Harold P. Benson (Oper. Res. Lett., 1991)

Using efficient feasible directions in interactive multiple objective linear programming. - Harold P. Benson; Yasemin Aksoy (Oper. Res. Lett., 1991)

A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case. - Harold P. Benson (J. Glob. Optim., 1993)

A finite concave minimization algorithm using branch and bound and neighbor generation. - Harold P. Benson; Serpil Sayin (J. Glob. Optim., 1994)

A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions. - Harold P. Benson (J. Glob. Optim., 1995)

Dynamic lot-sizing with setup cost reduction. - Meltem Denizel; S. Selçuk Erengüç; Harold P. Benson (Eur. J. Oper. Res., 1997)

Book Review. - Harold P. Benson (J. Glob. Optim., 1997)

An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem. - Harold P. Benson (J. Glob. Optim., 1998)

Global Optimization in Practice: An Application to Interactive Multiple Objective Linear Programming. - Harold P. Benson; Dongyeup Lee; J. Peter McClure (J. Glob. Optim., 1998)

An Outcome Space Branch and Bound-Outer Approximation Algorithm for Convex Multiplicative Programming. - Harold P. Benson (J. Glob. Optim., 1999)

Pivoting in an Outcome Polyhedron. - Harold P. Benson; Erjiang Sun (J. Glob. Optim., 2000)

A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program. - Harold P. Benson; Erjiang Sun (Eur. J. Oper. Res., 2002)

Using concave envelopes to globally solve the nonlinear sum of ratios problem. - Harold P. Benson (J. Glob. Optim., 2002)

On the Construction of Convex and Concave Envelope Formulas for Bilinear and Fractional Functions on Quadrilaterals. - Harold P. Benson (Comput. Optim. Appl., 2004)

Fractional programming with convex quadratic forms and functions. - Harold P. Benson (Eur. J. Oper. Res., 2006)

Matthias Ehrgott, Multicriteria Optimization (second ed.), Springer (2005) ISBN 3-540-21398-8 323 pages. - Harold P. Benson (Eur. J. Oper. Res., 2007)

A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem. - Harold P. Benson (Eur. J. Oper. Res., 2007)

Branch-and-reduce algorithm for convex programs with additional multiplicative constraints. - Harold P. Benson; Erjiang Sun (Eur. J. Oper. Res., 2009)

Concave Programming. - Harold P. Benson (Encyclopedia of Optimization, 2009)

Multi-objective Optimization: Interactive Methods for Preference Value Functions. - Harold P. Benson (Encyclopedia of Optimization, 2009)

Multi-objective Optimization: Pareto Optimal Solutions, Properties. - Harold P. Benson (Encyclopedia of Optimization, 2009)

An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem. - Harold P. Benson (J. Glob. Optim., 2012)

Preface. - Nguyen V. Thoai; Harold P. Benson; Panos M. Pardalos (J. Glob. Optim., 2012)