Harold P. Benson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2012

An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problemHarold P. Benson. jgo, 52(3):553-574, 2012. [doi]

PrefaceNguyen V. Thoai, Harold P. Benson, Panos M. Pardalos. jgo, 52(3):369-370, 2012. [doi]

2009

Branch-and-reduce algorithm for convex programs with additional multiplicative constraintsHarold P. Benson, Erjiang Sun. eor, 199(1):1-8, 2009. [doi]

2007

A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problemHarold P. Benson. eor, 182(2):597-611, 2007. [doi]

Matthias Ehrgott, Multicriteria Optimization (second ed.), Springer (2005) ISBN 3-540-21398-8 323 pagesHarold P. Benson. eor, 176(3):1961-1964, 2007. [doi]

2006

Fractional programming with convex quadratic forms and functionsHarold P. Benson. eor, 173(2):351-369, 2006. [doi]

2004

On the Construction of Convex and Concave Envelope Formulas for Bilinear and Fractional Functions on QuadrilateralsHarold P. Benson. coap, 27(1):5-22, 2004. [doi]

2002

A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear programHarold P. Benson, Erjiang Sun. eor, 139(1):26-41, 2002. [doi]

Using concave envelopes to globally solve the nonlinear sum of ratios problemHarold P. Benson. jgo, 22(1-4):343-364, 2002. [doi]

2000

Pivoting in an Outcome PolyhedronHarold P. Benson, Erjiang Sun. jgo, 16(4):301-323, 2000. [doi]

1999

An Outcome Space Branch and Bound-Outer Approximation Algorithm for Convex Multiplicative ProgrammingHarold P. Benson. jgo, 15(4):315-342, 1999. [doi]

1998

Global Optimization in Practice: An Application to Interactive Multiple Objective Linear ProgrammingHarold P. Benson, Dongyeup Lee, J. Peter McClure. jgo, 12(4):353-372, 1998. [doi]

An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming ProblemHarold P. Benson. jgo, 13(1):1-24, 1998. [doi]

1997

Book ReviewHarold P. Benson. jgo, 11(2):219-220, 1997. [doi]

Dynamic lot-sizing with setup cost reductionMeltem Denizel, S. Selçuk Erengüç, Harold P. Benson. eor, 100(3):537-549, 1997. [doi]

1995

A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functionsHarold P. Benson. jgo, 6(3):231-251, 1995. [doi]

1994

Book reviewHarold P. Benson. jgo, 4(1):113-115, 1994. [doi]

A finite concave minimization algorithm using branch and bound and neighbor generationHarold P. Benson, Serpil Sayin. jgo, 5(1):1-14, 1994. [doi]

1993

A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence caseHarold P. Benson. jgo, 3(1):95-111, 1993. [doi]

1991

An all-linear programming relaxation algorithm for optimizing over the efficient setHarold P. Benson. jgo, 1(1):83-104, 1991. [doi]

Using efficient feasible directions in interactive multiple objective linear programmingHarold P. Benson, Yasemin Aksoy. orl, 10(4):203-209, 1991. [doi]

Complete efficiency and the initialization of algorithms for multiple objective programmingHarold P. Benson. orl, 10(8):481-487, 1991. [doi]

Concave minimization via conical partitions and polyhedral outer approximationReiner Horst, Nguyen V. Thoai, Harold P. Benson. mp, 50:259-274, 1991.

1986

Technical Note - On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint CoefficientsS. Selçuk Erengüç, Harold P. Benson. ior, 34(4):650-653, 1986. [doi]

Sign in or sign up to see more results.

runs on WebDSL