| Publication | Date of Publication | Type |
|---|
| Globalized Robust Optimization for Nonlinear Uncertain Inequalities | 2017-10-04 | Paper |
| Robust capacity assignment solutions for telecommunications networks with uncertain demands | 2016-06-10 | Paper |
| Deriving robust counterparts of nonlinear uncertain inequalities | 2015-02-09 | Paper |
| Confidence level solutions for stochastic programming | 2014-03-19 | Paper |
| Step decision rules for multistage stochastic programming: a heuristic approach | 2014-03-19 | Paper |
| Distributionally robust workforce scheduling in call centres with uncertain arrival rates | 2013-06-24 | Paper |
| Semi-Lagrangian relaxation applied to the uncapacitated facility location problem | 2012-07-10 | Paper |
| Design and Operations of Gas Transmission Networks | 2012-06-18 | Paper |
| A Structure-Exploiting Tool in Algebraic Modeling Languages | 2012-02-19 | Paper |
| A Survey of Algorithms for Convex Multicommodity Flow Problems | 2012-02-12 | Paper |
| A Game of International Climate Policy Solved by a Homogeneous Oracle-Based Method for Variational Inequalities | 2011-08-08 | Paper |
| A partitioning algorithm for the network loading problem | 2010-01-15 | Paper |
| Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM | 2009-08-13 | Paper |
| An oracle based method to compute a coupled equilibrium in a model of international climate policy | 2009-08-04 | Paper |
| ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems | 2009-05-05 | Paper |
| ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum | 2009-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5297402 | 2007-07-18 | Paper |
| Automatic formulation of stochastic programs via an algebraic modeling language | 2007-03-20 | Paper |
| Solving the \(p\)-median problem with a semi-Lagrangian relaxation | 2006-11-17 | Paper |
| Computational Science - ICCS 2004 | 2005-12-23 | Paper |
| Interior Point Methods for Linear Optimization | 2005-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463039 | 2005-08-01 | Paper |
| A practical implementation of stochastic programming: an application to the evaluation of option contracts in supply chains | 2004-09-23 | Paper |
| Large-scale convex optimization methods for air quality policy assessment. | 2004-03-14 | Paper |
| Augmented self-concordant barriers and nonlinear optimization problems with finite complexity | 2004-03-11 | Paper |
| Multiple cuts with a homogeneous analytic center cutting plane method | 2003-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527200 | 2002-07-30 | Paper |
| On constrained optimization by adjoint based quasi-Newton methods | 2002-01-01 | Paper |
| Building and solving large-scale stochastic programs on an affordable distributed computing system | 2001-06-14 | Paper |
| Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs | 2001-04-09 | Paper |
| Multiple Cuts in the Analytic Center Cutting Plane Method | 2001-03-19 | Paper |
| Parallel implementation of a central decomposition method for solving large-scale planning problems | 2001-01-01 | Paper |
| Homogeneous analytic center cutting plane methods with approximate centers | 2000-12-06 | Paper |
| Shallow, deep and very deep cuts in the analytic center cutting plane method. | 2000-07-21 | Paper |
| Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities | 1999-11-24 | Paper |
| A two-cut approach in the analytic center cutting plane method | 1999-09-07 | Paper |
| Using an interior point method for the master problem in a decomposition approach | 1999-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4355913 | 1999-02-18 | Paper |
| On improvements to the analytic center cutting plane method | 1998-12-07 | Paper |
| Computing Maximum Likelihood Estimators of Convex Density Functions | 1998-05-12 | Paper |
| Solving nonlinear multicommodity flow problems by the analytic center cutting plane method | 1998-02-19 | Paper |
| A path-following version of the Todd-Burrell procedure for linear programming | 1997-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4339096 | 1997-06-04 | Paper |
| Achievable potential reductions in the method of Kojima et al. in the case of linear programming | 1997-04-21 | Paper |
| Primal-dual target-following algorithms for linear programming | 1996-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4895331 | 1996-10-14 | Paper |
| A cutting plane method from analytic centers for stochastic programming | 1996-09-18 | Paper |
| A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming | 1996-08-05 | Paper |
| Primal-dual algorithms for linear programming based on the logarithmic barrier method | 1994-12-04 | Paper |
| Short Steps with Karmarkar’s Projective Algorithm for Linear Programming | 1994-11-17 | Paper |
| Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming | 1994-07-18 | Paper |
| On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm | 1993-11-01 | Paper |
| Using central prices in the decomposition of linear programs | 1993-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036945 | 1993-05-18 | Paper |
| Alternative Approaches to Feasibility in Projective Methods for Linear Programming | 1993-04-01 | Paper |
| A polynomial method of approximate centers for linear programming | 1993-01-16 | Paper |
| Todd's low-complexity algorithm is a predictor-corrector path-following method | 1993-01-16 | Paper |
| A projective algorithm for linear programming with no regularity condition | 1993-01-16 | Paper |
| A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming | 1993-01-16 | Paper |
| Decomposition and Nondifferentiable Optimization with the Projective Algorithm | 1992-09-27 | Paper |
| Cutting planes and column generation techniques with the projective algorithm | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3494376 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3480806 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3833861 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733659 | 1989-01-01 | Paper |
| A fully polynomial time projective method | 1988-01-01 | Paper |
| An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex | 1987-01-01 | Paper |
| Curvilinear path and trust region in unconstrained optimization: A convergence analysis | 1987-01-01 | Paper |
| A polynomial Newton method for linear programming | 1986-01-01 | Paper |
| Lipschitzian Solutions of Perturbed Nonlinear Programming Problems | 1986-01-01 | Paper |
| A restricted trust region algorithm for unconstrained optimization | 1985-01-01 | Paper |
| Strong and Weak Convexity of Sets and Functions | 1983-01-01 | Paper |
| Strong convexity of sets and functions | 1982-01-01 | Paper |
| Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon | 1978-01-01 | Paper |
| Unconstrained Optimization by Approximation of the Gradient Path | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4041305 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4053352 | 1972-01-01 | Paper |
