default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarold P. Benson
Person information
- affiliation: University of Florida
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j24]Nguyen V. Thoai, Harold P. Benson, Panos M. Pardalos:
Preface. J. Glob. Optim. 52(3): 369-370 (2012)- [j23]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): 553-574 (2012)
2000 – 2009
- 2009
- [j22]Harold P. Benson, Erjiang Sun:
Branch-and-reduce algorithm for convex programs with additional multiplicative constraints. Eur. J. Oper. Res. 199(1): 1-8 (2009) - [r3]Harold P. Benson:
Concave Programming. Encyclopedia of Optimization 2009: 462-466 - [r2]Harold P. Benson:
Multi-objective Optimization: Interactive Methods for Preference Value Functions. Encyclopedia of Optimization 2009: 2471-2474 - [r1]Harold P. Benson:
Multi-objective Optimization: Pareto Optimal Solutions, Properties. Encyclopedia of Optimization 2009: 2478-2481 - 2007
- [j21]Harold P. Benson:
Matthias Ehrgott, Multicriteria Optimization (second ed.), Springer (2005) ISBN 3-540-21398-8 323 pages. Eur. J. Oper. Res. 176(3): 1961-1964 (2007) - [j20]Harold P. Benson:
A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem. Eur. J. Oper. Res. 182(2): 597-611 (2007) - 2006
- [j19]Harold P. Benson:
Fractional programming with convex quadratic forms and functions. Eur. J. Oper. Res. 173(2): 351-369 (2006) - 2004
- [j18]Harold P. Benson:
On the Construction of Convex and Concave Envelope Formulas for Bilinear and Fractional Functions on Quadrilaterals. Comput. Optim. Appl. 27(1): 5-22 (2004) - 2002
- [j17]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): 26-41 (2002) - [j16]Harold P. Benson:
Using concave envelopes to globally solve the nonlinear sum of ratios problem. J. Glob. Optim. 22(1-4): 343-364 (2002) - 2000
- [j15]Harold P. Benson, Erjiang Sun:
Pivoting in an Outcome Polyhedron. J. Glob. Optim. 16(4): 301-323 (2000)
1990 – 1999
- 1999
- [j14]Harold P. Benson:
An Outcome Space Branch and Bound-Outer Approximation Algorithm for Convex Multiplicative Programming. J. Glob. Optim. 15(4): 315-342 (1999) - 1998
- [j13]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): 353-372 (1998) - [j12]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): 1-24 (1998) - 1997
- [j11]Meltem Denizel, S. Selçuk Erengüç, Harold P. Benson:
Dynamic lot-sizing with setup cost reduction. Eur. J. Oper. Res. 100(3): 537-549 (1997) - [j10]Harold P. Benson:
Book Review. J. Glob. Optim. 11(2): 219-220 (1997) - 1995
- [j9]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): 231-251 (1995) - 1994
- [j8]Harold P. Benson:
Book review. J. Glob. Optim. 4(1): 113-115 (1994) - [j7]Harold P. Benson, Serpil Sayin
:
A finite concave minimization algorithm using branch and bound and neighbor generation. J. Glob. Optim. 5(1): 1-14 (1994) - 1993
- [j6]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): 95-111 (1993) - 1991
- [j5]Harold P. Benson:
An all-linear programming relaxation algorithm for optimizing over the efficient set. J. Glob. Optim. 1(1): 83-104 (1991) - [j4]Reiner Horst, Nguyen V. Thoai, Harold P. Benson:
Concave minimization via conical partitions and polyhedral outer approximation. Math. Program. 50: 259-274 (1991) - [j3]Harold P. Benson, Yasemin Aksoy:
Using efficient feasible directions in interactive multiple objective linear programming. Oper. Res. Lett. 10(4): 203-209 (1991) - [j2]Harold P. Benson:
Complete efficiency and the initialization of algorithms for multiple objective programming. Oper. Res. Lett. 10(8): 481-487 (1991)
1980 – 1989
- 1986
- [j1]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): 650-653 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
