| Year |
Citation |
Score |
| 2016 |
Yenipazarli A, Benson HP, Erenguc S. A branch-and-bound algorithm for the concave cost supply problem International Journal of Production Research. 54: 3943-3961. DOI: 10.1080/00207543.2016.1165358 |
0.731 |
|
| 2015 |
Benson HP. Using concave envelopes to globally solve the nonlinear sum of ratios problem Journal of Global Optimization. 22: 343-364. DOI: 10.1023/A:1013869015288 |
0.798 |
|
| 2012 |
Benson HP. An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem Journal of Global Optimization. 52: 553-574. DOI: 10.1007/S10898-011-9786-Y |
0.812 |
|
| 2010 |
Benson HP. Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs Journal of Optimization Theory and Applications. 146: 1-18. DOI: 10.1007/S10957-010-9647-8 |
0.812 |
|
| 2010 |
Benson HP. Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint Journal of Optimization Theory and Applications. 145: 213-233. DOI: 10.1007/S10957-009-9636-Y |
0.816 |
|
| 2009 |
Benson HP, Sun E. Branch-and-reduce algorithm for convex programs with additional multiplicative constraints European Journal of Operational Research. 199: 1-8. DOI: 10.1016/J.Ejor.2008.09.023 |
0.861 |
|
| 2008 |
Benson HP. Global maximization of a generalized concave multiplicative function Journal of Optimization Theory and Applications. 137: 105-120. DOI: 10.1007/S10957-007-9323-9 |
0.792 |
|
| 2007 |
Benson HP. A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem European Journal of Operational Research. 182: 597-611. DOI: 10.1016/J.Ejor.2006.08.036 |
0.799 |
|
| 2007 |
Benson HP. Matthias Ehrgott, Multicriteria Optimization (second ed.), Springer (2005) ISBN 3-540-21398-8 323 pages European Journal of Operational Research. 176: 1961-1964. DOI: 10.1016/J.Ejor.2006.02.001 |
0.635 |
|
| 2007 |
Benson HP. Solving sum of ratios fractional programs via concave minimization Journal of Optimization Theory and Applications. 135: 1-17. DOI: 10.1007/S10957-007-9199-8 |
0.803 |
|
| 2006 |
Benson HP. Fractional programming with convex quadratic forms and functions European Journal of Operational Research. 173: 351-369. DOI: 10.1016/J.Ejor.2005.02.069 |
0.812 |
|
| 2006 |
Benson HP. Continuous modular design problem: Analysis and solution algorithms Journal of Optimization Theory and Applications. 131: 159-178. DOI: 10.1007/S10957-006-9141-5 |
0.78 |
|
| 2006 |
Benson HP. Maximizing the ratio of two convex functions over a convex set Naval Research Logistics. 53: 309-317. DOI: 10.1002/Nav.20143 |
0.796 |
|
| 2005 |
Benson HP, Boncompagni E, Guerinot ML. An iron uptake operon required for proper nodule development in the Bradyrhizobium japonicum-soybean symbiosis Molecular Plant-Microbe Interactions. 18: 950-959. PMID 16167765 DOI: 10.1094/Mpmi-18-0950 |
0.544 |
|
| 2005 |
Benson HP. Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints Journal of Optimization Theory and Applications. 126: 41-61. DOI: 10.1007/S10957-005-2655-4 |
0.805 |
|
| 2005 |
Benson HP. A global optimization approach for generating efficient points for multiobjective concave fractional programs Journal of Multi-Criteria Decision Analysis. 13: 15-28. DOI: 10.1002/Mcda.369 |
0.787 |
|
| 2004 |
Benson HP. On the global optimization of sums of linear fractional functions over a convex set Journal of Optimization Theory and Applications. 121: 19-39. DOI: 10.1023/B:Jota.0000026129.07165.5A |
0.808 |
|
| 2004 |
Benson HP. On the Construction of Convex and Concave Envelope Formulas for Bilinear and Fractional Functions on Quadrilaterals Computational Optimization and Applications. 27: 5-22. DOI: 10.1023/B:Coap.0000004976.52180.7F |
0.707 |
|
| 2004 |
Benson HP. Concave envelopes of monomial functions over rectangles Naval Research Logistics. 51: 467-476. DOI: 10.1002/Nav.20011 |
0.774 |
|
| 2003 |
Benson HP. Generating sum-of-ratios test problems in global optimization Journal of Optimization Theory and Applications. 119: 615-621. DOI: 10.1023/B:Jota.0000006959.01650.59 |
0.744 |
|
| 2002 |
Benson HP. Global optimization algorithm for the nonlinear sum of ratios problem Journal of Optimization Theory and Applications. 112: 1-29. DOI: 10.1023/A:1013072027218 |
0.793 |
|
| 2002 |
Benson HP, Sun E. A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program European Journal of Operational Research. 139: 26-41. DOI: 10.1016/S0377-2217(01)00153-9 |
0.846 |
|
| 2001 |
Benson HP. Global optimization of nonlinear sums of ratios Journal of Mathematical Analysis and Applications. 263: 301-315. DOI: 10.1006/Jmaa.2001.7650 |
0.805 |
|
| 2000 |
Benson HP, Sun E. Pivoting in an Outcome Polyhedron Journal of Global Optimization. 16: 301-323. DOI: 10.1023/A:1008364005245 |
0.8 |
|
| 2000 |
Benson HP, Boger GM. Outcome-space cutting-plane algorithm for linear multiplicative programming Journal of Optimization Theory and Applications. 104: 301-322. DOI: 10.1023/A:1004657629105 |
0.803 |
|
| 2000 |
Benson HP, Sun E. Outcome space partition of the weight set in multiobjective linear programming Journal of Optimization Theory and Applications. 105: 17-36. DOI: 10.1023/A:1004605810296 |
0.755 |
|
| 1999 |
Benson HP. Generalized γ-valid cut procedure for concave minimization Journal of Optimization Theory and Applications. 102: 289-298. DOI: 10.1023/A:1021776323080 |
0.734 |
|
| 1999 |
Benson HP. An Outcome Space Branch and Bound-Outer Approximation Algorithm for Convex Multiplicative Programming Journal of Global Optimization. 15: 315-342. DOI: 10.1023/A:1008316429329 |
0.774 |
|
| 1999 |
Benson HP, Sun E. New Closedness Results for Efficient Sets in Multiple Objective Mathematical Programming Journal of Mathematical Analysis and Applications. 238: 277-296. DOI: 10.1006/Jmaa.1999.6541 |
0.836 |
|
| 1998 |
Benson HP. Hybrid approach for solving multiple-objective linear programs in outcome space Journal of Optimization Theory and Applications. 98: 17-35. DOI: 10.1023/A:1022628612489 |
0.765 |
|
| 1998 |
Benson HP. Further Analysis of an Outcome Set-Based Algorithm for Multiple-Objective Linear Programming Journal of Optimization Theory and Applications. 97: 1-10. DOI: 10.1023/A:1022614814789 |
0.793 |
|
| 1998 |
Benson HP, Lee D, Mcclure JP. Global Optimization in Practice: An Application to Interactive Multiple Objective Linear Programming Journal of Global Optimization. 12: 353-372. DOI: 10.1023/A:1008285515867 |
0.752 |
|
| 1998 |
Benson HP. An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem Journal of Global Optimization. 13: 1-24. DOI: 10.1023/A:1008215702611 |
0.793 |
|
| 1997 |
Benson HP, Boger GM. Multiplicative programming problems: Analysis and efficient point search heuristic Journal of Optimization Theory and Applications. 94: 487-510. DOI: 10.1023/A:1022600232285 |
0.799 |
|
| 1997 |
Denizel M, Erengüç S, Benson HP. Dynamic lot-sizing with setup cost reduction European Journal of Operational Research. 100: 537-549. DOI: 10.1016/S0377-2217(95)00327-4 |
0.668 |
|
| 1997 |
Benson HP, Sayin S. Towards finding global representations of the efficient set in multiple objective mathematical programming Naval Research Logistics. 44: 47-67. DOI: 10.1002/(Sici)1520-6750(199702)44:1<47::Aid-Nav3>3.0.Co;2-M |
0.711 |
|
| 1997 |
Benson HP, Lee D, McCLURE JP. A multiple‐objective linear programming model for the citrus rootstock selection problem in Florida Journal of Multi-Criteria Decision Analysis. 6: 283-295. DOI: 10.1002/(Sici)1099-1360(199709)6:5<283::Aid-Mcda160>3.0.Co;2-R |
0.727 |
|
| 1996 |
Benson HP, Lee D. Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem Journal of Optimization Theory and Applications. 88: 77-105. DOI: 10.1007/Bf02192023 |
0.804 |
|
| 1996 |
Benson HP. Deterministic algorithms for constrained concave minimization: A unified critical survey Naval Research Logistics. 43: 765-795. DOI: 10.1002/(Sici)1520-6750(199609)43:6<765::Aid-Nav1>3.0.Co;2-2 |
0.736 |
|
| 1995 |
Benson HP. A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions Journal of Global Optimization. 6: 231-251. DOI: 10.1007/Bf01099463 |
0.704 |
|
| 1994 |
Benson HP, Sayin S. Optimization over the efficient set: Four special cases Journal of Optimization Theory and Applications. 80: 3-18. DOI: 10.1007/Bf02196590 |
0.768 |
|
| 1994 |
Benson HP, Sayin S. A finite concave minimization algorithm using branch and bound and neighbor generation Journal of Global Optimization. 5: 1-14. DOI: 10.1007/Bf01096999 |
0.775 |
|
| 1993 |
Benson HP. A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case Journal of Global Optimization. 3: 95-111. DOI: 10.1007/Bf01100242 |
0.81 |
|
| 1993 |
Benson HP, Sayin S. A face search heuristic algorithm for optimizing over the efficient set Naval Research Logistics. 40: 103-116. DOI: 10.1002/1520-6750(199302)40:1<103::Aid-Nav3220400107>3.0.Co;2-A |
0.736 |
|
| 1992 |
Benson HP. A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set Journal of Optimization Theory and Applications. 73: 47-64. DOI: 10.1007/Bf00940077 |
0.827 |
|
| 1991 |
Knechel WR, Benson HP. An Optimization Approach for Scheduling Internal Audits of Divisions Decision Sciences. 22: 391-405. DOI: 10.1111/J.1540-5915.1991.Tb00354.X |
0.672 |
|
| 1991 |
Erenguc SS, Benson HP. An algorithm for indefinite integer quadratic programming Computers and Mathematics With Applications. 21: 99-106. DOI: 10.1016/0898-1221(91)90164-Y |
0.808 |
|
| 1991 |
Benson HP, Horst R. A branch and bound-outer approximation algorithm for concave minimization over a convex set Computers and Mathematics With Applications. 21: 67-76. DOI: 10.1016/0898-1221(91)90161-V |
0.777 |
|
| 1991 |
Benson HP, Aksoy Y. Using efficient feasible directions in interactive multiple objective linear programming Operations Research Letters. 10: 203-209. DOI: 10.1016/0167-6377(91)90060-3 |
0.754 |
|
| 1991 |
Benson HP. Complete efficiency and the initialization of algorithms for multiple objective programming Operations Research Letters. 10: 481-487. DOI: 10.1016/0167-6377(91)90026-L |
0.764 |
|
| 1991 |
Horst R, Thoai NV, Benson HP. Concave minimization via conical partitions and polyhedral outer approximation Mathematical Programming. 50: 259-274. DOI: 10.1007/Bf01594938 |
0.802 |
|
| 1991 |
Benson HP. An all-linear programming relaxation algorithm for optimizing over the efficient set Journal of Global Optimization. 1: 83-104. DOI: 10.1007/Bf00120667 |
0.827 |
|
| 1990 |
Benson HP. Separable concave minimization via partial outer approximation and branch and bound Operations Research Letters. 9: 389-394. DOI: 10.1016/0167-6377(90)90059-E |
0.792 |
|
| 1990 |
Benson HP, Selcuk Erenguc S, Horst R. A note on adapting methods for continuous global optimization to the discrete case Annals of Operations Research. 25: 243-252. DOI: 10.1007/Bf02283698 |
0.759 |
|
| 1990 |
Benson HP, Erenguc SS. An algorithm for concave integer minimization over a polyhedron Naval Research Logistics. 37: 515-525. DOI: 10.1002/1520-6750(199008)37:4<515::Aid-Nav3220370406>3.0.Co;2-X |
0.73 |
|
| 1989 |
Benson HP. On the structure and properties of a linear multilevel programming problem Journal of Optimization Theory and Applications. 60: 353-373. DOI: 10.1007/Bf00940342 |
0.792 |
|
| 1988 |
Benson HP, Erenguc SS. Using convex envelopes to solve the interactive fixed-charge linear programming problem Journal of Optimization Theory and Applications. 59: 223-246. DOI: 10.1007/Bf00938310 |
0.782 |
|
| 1987 |
Benson HP, Morin TL. A bicriteria mathematical programming model for nutrition planning in developing nations Management Science. 33: 1593-1601. DOI: 10.1287/Mnsc.33.12.1593 |
0.791 |
|
| 1986 |
Erenguc SS, Benson HP. Technical Note-On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint Coefficients Operations Research. 34: 650-653. DOI: 10.1287/Opre.34.4.650 |
0.736 |
|
| 1986 |
Benson HP. An algorithm for optimizing over the weakly-efficient set European Journal of Operational Research. 25: 192-199. DOI: 10.1016/0377-2217(86)90085-8 |
0.817 |
|
| 1986 |
Erenguc SS, Benson HP. The interactive fixed charge linear programming problem Naval Research Logistics Quarterly. 33: 157-177. DOI: 10.1002/Nav.3800330202 |
0.765 |
|
| 1985 |
Benson HP. Multiple Objective Linear Programming with Parametric Criteria Coefficients Management Science. 31: 461-474. DOI: 10.1287/Mnsc.31.4.461 |
0.798 |
|
| 1985 |
Benson HP. Note-Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming Management Science. 31: 240-248. DOI: 10.1287/Mnsc.31.2.240 |
0.755 |
|
| 1985 |
Benson HP. On the optimal value function for certain linear programs with unbounded optimal solution sets Journal of Optimization Theory and Applications. 46: 55-66. DOI: 10.1007/Bf00938759 |
0.747 |
|
| 1985 |
Benson HP. A finite algorithm for concave minimization over a polyhedron Naval Research Logistics Quarterly. 32: 165-177. DOI: 10.1002/Nav.3800320119 |
0.798 |
|
| 1984 |
Benson HP. Optimization over the efficient set Journal of Mathematical Analysis and Applications. 98: 562-580. DOI: 10.1016/0022-247X(84)90269-5 |
0.753 |
|
| 1983 |
Benson HP. Efficiency and proper efficiency in vector maximization with respect to cones Journal of Mathematical Analysis and Applications. 93: 273-289. DOI: 10.1016/0022-247X(83)90230-5 |
0.721 |
|
| 1983 |
Benson HP. On a domination property for vector maximization with respect to cones Journal of Optimization Theory and Applications. 39: 125-132. DOI: 10.1007/Bf00934467 |
0.659 |
|
| 1982 |
Cermak W, Lieberman J, Benson HP. An Integrated Approach to the Analysis of Binary Choice Data Applied Psychological Measurement. 6: 31-40. DOI: 10.1177/014662168200600103 |
0.622 |
|
| 1982 |
Benson HP. Admissible points of a convex polyhedron Journal of Optimization Theory and Applications. 38: 341-361. DOI: 10.1007/Bf00935343 |
0.773 |
|
| 1982 |
Benson HP. Algorithms for parametric nonconvex programming Journal of Optimization Theory and Applications. 38: 319-340. DOI: 10.1007/Bf00935342 |
0.798 |
|
| 1982 |
Benson HP. On the convergence of two branch-and-bound algorithms for nonconvex programming problems Journal of Optimization Theory and Applications. 36: 129-134. DOI: 10.1007/Bf00934342 |
0.763 |
|
| 1981 |
Benson HP. Finding an initial efficient extreme point for a linear multiple objective program Journal of the Operational Research Society. 32: 495-498. DOI: 10.1057/Jors.1981.100 |
0.69 |
|
| 1979 |
Benson HP. An improved definition of proper efficiency for vector maximization with respect to cones Journal of Mathematical Analysis and Applications. 71: 232-241. DOI: 10.1016/0022-247X(79)90226-9 |
0.64 |
|
| 1979 |
Benson HP. Vector maximization with two objective functions Journal of Optimization Theory and Applications. 28: 253-257. DOI: 10.1007/Bf00933245 |
0.754 |
|
| 1978 |
Benson HP. Existence of efficient solutions for vector maximization problems Journal of Optimization Theory and Applications. 26: 569-580. DOI: 10.1007/Bf00933152 |
0.752 |
|
| Show low-probability matches. |
