Harold P. Benson

Publication Activity (10 Years)

Years Active: 1986-2012
Publications (10 Years): 0

Top Topics

Information Retrieval And Extraction

Equality And Inequality Constraints

Nonlinear Programming

Top Venues

J. Glob. Optim.

Publications

Harold P. Benson
An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem. J. Glob. Optim. 52 (3) (2012)
Nguyen V. Thoai, Harold P. Benson, Panos M. Pardalos
Preface. J. Glob. Optim. 52 (3) (2012)
Harold P. Benson, Erjiang Sun
Branch-and-reduce algorithm for convex programs with additional multiplicative constraints. Eur. J. Oper. Res. 199 (1) (2009)
Harold P. Benson
Matthias Ehrgott, Multicriteria Optimization (second ed.), Springer (2005) ISBN 3-540-21398-8 323 pages. Eur. J. Oper. Res. 176 (3) (2007)
Harold P. Benson
A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem. Eur. J. Oper. Res. 182 (2) (2007)
Harold P. Benson
Fractional programming with convex quadratic forms and functions. Eur. J. Oper. Res. 173 (2) (2006)
Harold P. Benson
On the Construction of Convex and Concave Envelope Formulas for Bilinear and Fractional Functions on Quadrilaterals. Comput. Optim. Appl. 27 (1) (2004)
Harold P. Benson
Using concave envelopes to globally solve the nonlinear sum of ratios problem. J. Glob. Optim. 22 (1-4) (2002)
Harold P. Benson, Erjiang Sun
A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program. Eur. J. Oper. Res. 139 (1) (2002)
Harold P. Benson, Erjiang Sun
Pivoting in an Outcome Polyhedron. J. Glob. Optim. 16 (4) (2000)
Harold P. Benson
An Outcome Space Branch and Bound-Outer Approximation Algorithm for Convex Multiplicative Programming. J. Glob. Optim. 15 (4) (1999)
Harold P. Benson, Dongyeup Lee, J. Peter McClure
Global Optimization in Practice: An Application to Interactive Multiple Objective Linear Programming. J. Glob. Optim. 12 (4) (1998)
Harold P. Benson
An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem. J. Glob. Optim. 13 (1) (1998)
Harold P. Benson
Book Review. J. Glob. Optim. 11 (2) (1997)
Meltem Denizel, S. Selçuk Erengüç, Harold P. Benson
Dynamic lot-sizing with setup cost reduction. Eur. J. Oper. Res. 100 (3) (1997)
Harold P. Benson
A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions. J. Glob. Optim. 6 (3) (1995)
Harold P. Benson
Book review. J. Glob. Optim. 4 (1) (1994)
Harold P. Benson, Serpil Sayin
A finite concave minimization algorithm using branch and bound and neighbor generation. J. Glob. Optim. 5 (1) (1994)
Harold P. Benson
A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case. J. Glob. Optim. 3 (1) (1993)
Harold P. Benson, Yasemin Aksoy
Using efficient feasible directions in interactive multiple objective linear programming. Oper. Res. Lett. 10 (4) (1991)
Harold P. Benson
Complete efficiency and the initialization of algorithms for multiple objective programming. Oper. Res. Lett. 10 (8) (1991)
Reiner Horst, Nguyen V. Thoai, Harold P. Benson
Concave minimization via conical partitions and polyhedral outer approximation. Math. Program. 50 (1991)
Harold P. Benson
An all-linear programming relaxation algorithm for optimizing over the efficient set. J. Glob. Optim. 1 (1) (1991)
S. Selçuk Erengüç, Harold P. Benson
Technical Note - On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint Coefficients. Oper. Res. 34 (4) (1986)