| Publication | Date of Publication | Type |
|---|
| Linear Programming Computation | 2022-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5197229 | 2019-09-20 | Paper |
| Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis | 2019-03-18 | Paper |
| A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming | 2017-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2993676 | 2016-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5165812 | 2014-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5165825 | 2014-06-30 | Paper |
| On the Local and Superlinear Convergence of a Parameterized DFP Method | 2014-04-14 | Paper |
| Linear Programming Computation | 2013-10-10 | Paper |
| An affine-scaling pivot algorithm for linear programming | 2013-07-24 | Paper |
| A Fast Algorithm for Linear Programming | 2012-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5320265 | 2009-07-22 | Paper |
| Efficient nested pricing in the simplex algorithm | 2008-09-10 | Paper |
| An efficient approach to updating simplex multipliers in the simplex algorithm | 2008-06-04 | Paper |
| A primal deficient-basis simplex algorithm for linear programming | 2008-03-26 | Paper |
| A largest-distance pivot rule for the simplex algorithm | 2007-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424481 | 2007-02-16 | Paper |
| Feasible region contraction interior point algorithm | 2007-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5491562 | 2006-10-09 | Paper |
| Combined projected gradient algorithm for linear programming | 2006-08-10 | Paper |
| A Revised Dual Projective Pivot Algorithm for Linear Programming | 2005-09-16 | Paper |
| A dual projective pivot algorithm for linear programming | 2005-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415787 | 2003-08-07 | Paper |
| A phase-1 approach for the generalized simplex algorithm | 2002-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4545408 | 2002-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4545634 | 2002-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4522255 | 2002-06-02 | Paper |
| A projective simplex algorithm using LU decomposition | 2001-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4719189 | 2000-01-27 | Paper |
| A projective simplex method for linear programming | 1999-11-29 | Paper |
| A basis-defiency-allowing variation of the simplex method for linear programming | 1999-11-08 | Paper |
| The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study | 1999-04-27 | Paper |
| A dual projective simplex method for linear programming | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888222 | 1997-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4879697 | 1996-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4324544 | 1995-02-28 | Paper |
| A Variant of the Dual Pivoting Rule in Linear Programming | 1995-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4039241 | 1993-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4203108 | 1993-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3990256 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3990267 | 1992-06-28 | Paper |
| A simplex-like method with bisection for linear programming1 | 1992-06-26 | Paper |
| Practical finite pivoting rules for the simplex method | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217083 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5186622 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3660801 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3657301 | 1981-01-01 | Paper |
