| Publication | Date of Publication | Type |
|---|
| An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem | 2012-06-13 | Paper |
| A global optimization approach for generating efficient points for multiobjective concave fractional programs | 2011-02-10 | Paper |
| Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs | 2010-10-27 | Paper |
| Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint | 2010-08-13 | Paper |
| Branch-and-reduce algorithm for convex programs with additional multiplicative constraints | 2009-12-07 | Paper |
| Global maximization of a generalized concave multiplicative function | 2008-06-04 | Paper |
| Maximizing the ratio of two convex functions over a convex set | 2008-01-23 | Paper |
| Solving sum of ratios fractional programs via concave minimization | 2008-01-04 | Paper |
| A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem | 2007-05-30 | Paper |
| Continuous modular design problem: analysis and solution algorithms | 2007-03-06 | Paper |
| Fractional programming with convex quadratic forms and functions | 2006-06-30 | Paper |
| Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints | 2006-02-08 | Paper |
| On the global optimization of sums of linear fractional functions over a convex set | 2005-01-19 | Paper |
| Concave envelopes of monomial functions over rectangles | 2005-01-11 | Paper |
| Using concave envelopes to globally solve the nonlinear sum of ratios problem | 2004-08-12 | Paper |
| Generating sum-of-ratios test problems in global optimization | 2004-08-06 | Paper |
| On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals | 2004-03-15 | Paper |
| Pivoting in an outcome polyhedron | 2004-01-27 | Paper |
| Global optimization of nonlinear sums of ratios | 2003-03-12 | Paper |
| A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program | 2002-06-16 | Paper |
| Global optimization algorithm for the nonlinear sum of ratios problem | 2002-04-11 | Paper |
| New closedness results for efficient sets in multiple objective mathematical programming | 2001-12-05 | Paper |
| Outcome space partition of the weight set in multiobjective linear programming | 2000-09-14 | Paper |
| Outcome-space cutting-plane algorithm for linear multiplicative programming | 2000-09-14 | Paper |
| Generalized \(\gamma\)-valid cut procedure for concave minimization | 2000-06-14 | Paper |
| An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming | 2000-06-05 | Paper |
| Dynamic lot-sizing with setup cost reduction | 1999-08-05 | Paper |
| An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem | 1999-03-18 | Paper |
| Hybrid approach for solving multiple-objective linear programs in outcome space | 1999-02-28 | Paper |
| Further analysis of an outcome set-based algorithm for multiple-objective linear programming | 1999-02-11 | Paper |
| Global optimization in practice: An application to interactive multiple objective linear programming | 1998-09-27 | Paper |
| Multiplicative programming problems: Analysis and efficient point search heuristic | 1998-06-04 | Paper |
| Generating the efficient outcome set in multiple objective linear programs: The bicriteria case | 1998-04-13 | Paper |
| A multiple-objective linear programming model for the citrus rootstock selection problem in Florida | 1997-12-02 | Paper |
| Towards finding global representations of the efficient set in multiple objective mathematical programming | 1997-08-05 | Paper |
| Deterministic algorithms for constrained concave minimization: A unified critical survey | 1997-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5686904 | 1996-12-11 | Paper |
| Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem | 1996-08-06 | Paper |
| A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions | 1995-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4833804 | 1995-05-23 | Paper |
| A finite concave minimization algorithm using branch and bound and neighbor generation | 1994-08-11 | Paper |
| A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set | 1994-04-27 | Paper |
| Optimization over the efficient set: Four special cases | 1994-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4695784 | 1993-06-29 | Paper |
| A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case | 1993-05-04 | Paper |
| Complete efficiency and the initialization of algorithms for multiple objective programming | 1992-06-28 | Paper |
| An all-linear programming relaxation algorithm for optimizing over the efficient set | 1992-06-26 | Paper |
| Using efficient feasible directions in interactive multiple objective linear programming | 1992-06-26 | Paper |
| Concave minimization via conical partitions and polyhedral outer approximation | 1991-01-01 | Paper |
| A branch and bound-outer approximation algorithm for concave minimization over a convex set | 1991-01-01 | Paper |
| A note on adapting methods for continuous global optimization to the discrete case | 1990-01-01 | Paper |
| An algorithm for concave integer minimization over a polyhedron | 1990-01-01 | Paper |
| Separable concave minimization via partial outer approximation and branch and bound | 1990-01-01 | Paper |
| On the structure and properties of a linear multilevel programming problem | 1989-01-01 | Paper |
| An algorithm for optimizing over the weakly-efficient set | 1986-01-01 | Paper |
| The interactive fixed charge linear programming problem | 1986-01-01 | Paper |
| Technical Note—On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint Coefficients | 1986-01-01 | Paper |
| Multiple Objective Linear Programming with Parametric Criteria Coefficients | 1985-01-01 | Paper |
| A finite algorithm for concave minimization over a polyhedron | 1985-01-01 | Paper |
| On the optimal value function for certain linear programs with unbounded optimal solution sets | 1985-01-01 | Paper |
| Note—Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming | 1985-01-01 | Paper |
| Optimization over the efficient set | 1984-01-01 | Paper |
| Efficiency and proper efficiency in vector maximization with respect to cones | 1983-01-01 | Paper |
| On a domination property for vector maximization with respect to cones | 1983-01-01 | Paper |
| Algorithms for parametric nonconvex programming | 1982-01-01 | Paper |
| On the convergence of two branch-and-bound algorithms for nonconvex programming problems | 1982-01-01 | Paper |
| Admissible points of a convex polyhedron | 1982-01-01 | Paper |
| Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program | 1981-01-01 | Paper |
| An improved definition of proper efficiency for vector maximization with respect to cones | 1979-01-01 | Paper |
| Vector maximization with two objective functions | 1979-01-01 | Paper |
| Existence of efficient solutions for vector maximization problems | 1978-01-01 | Paper |
| The Vector Maximization Problem: Proper Efficiency and Stability | 1977-01-01 | Paper |
