Harold P. Benson
According to our database^{1},
Harold P. Benson
authored at least 26 papers
between 1986 and 2012.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on cba.ufl.edu
On csauthors.net:
Bibliography
2012
J. Glob. Optim., 2012
An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem.
J. Glob. Optim., 2012
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Branchandreduce algorithm for convex programs with additional multiplicative constraints.
Eur. J. Oper. Res., 2009
2007
A simplicial branch and bound dualitybounds algorithm for the linear sumofratios problem.
Eur. J. Oper. Res., 2007
Matthias Ehrgott, Multicriteria Optimization (second ed.), Springer (2005) ISBN 3540213988 323 pages.
Eur. J. Oper. Res., 2007
2006
Eur. J. Oper. Res., 2006
2004
On the Construction of Convex and Concave Envelope Formulas for Bilinear and Fractional Functions on Quadrilaterals.
Comput. Optim. Appl., 2004
2002
J. Glob. Optim., 2002
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., 2002
2000
J. Glob. Optim., 2000
1999
An Outcome Space Branch and BoundOuter Approximation Algorithm for Convex Multiplicative Programming.
J. Glob. Optim., 1999
1998
Global Optimization in Practice: An Application to Interactive Multiple Objective Linear Programming.
J. Glob. Optim., 1998
An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem.
J. Glob. Optim., 1998
1997
Eur. J. Oper. Res., 1997
1995
A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions.
J. Glob. Optim., 1995
1994
A finite concave minimization algorithm using branch and bound and neighbor generation.
J. Glob. Optim., 1994
J. Glob. Optim., 1994
1993
A bisectionextreme point search algorithm for optimizing over the efficient set in the linear dependence case.
J. Glob. Optim., 1993
1991
Using efficient feasible directions in interactive multiple objective linear programming.
Oper. Res. Lett., 1991
Complete efficiency and the initialization of algorithms for multiple objective programming.
Oper. Res. Lett., 1991
Math. Program., 1991
An alllinear programming relaxation algorithm for optimizing over the efficient set.
J. Glob. Optim., 1991
1986
Technical Note  On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint Coefficients.
Oper. Res., 1986