| Publication | Date of Publication | Type |
|---|
The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model
Mathematical Methods of Operations Research | 2015-01-19 | Paper |
How fast does the simplex method usually work? Or: the search for (stochastic) independence
Mitteilungen der Deutschen Mathematiker-Vereinigung (DMV) | 2014-07-08 | Paper |
Average-case analysis of the double description method and the beneath-beyond algorithm
Discrete & Computational Geometry | 2007-04-26 | Paper |
Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure.
Journal of Complexity | 2003-05-14 | Paper |
Erratum: ``A sharp upper bound for the expected number of shadow vertices in LP-polyhedra under orthogonal projection on two-dimensional planes''
Mathematics of Operations Research | 2001-11-26 | Paper |
A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes
Mathematics of Operations Research | 2001-09-03 | Paper |
| scientific article; zbMATH DE number 1595061 (Why is no real title available?) | 2001-05-06 | Paper |
A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm
Mathematical Methods of Operations Research | 2000-05-07 | Paper |
Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
Discrete & Computational Geometry | 1997-11-12 | Paper |
| scientific article; zbMATH DE number 671942 (Why is no real title available?) | 1995-04-17 | Paper |
Average saving effects in enumerative methods for solving knapsack problems
Journal of Complexity | 1994-04-12 | Paper |
Empirical Studies on the Average Efficiency of Simplex Variants under Rotation Symmetry
ORSA Journal on Computing | 1994-03-24 | Paper |
| scientific article; zbMATH DE number 17632 (Why is no real title available?) | 1992-06-26 | Paper |
The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
ZOR - Methods and Models of Operations Research | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4197740 (Why is no real title available?) | 1990-01-01 | Paper |
The simplex method. A probabilistic analysis
Algorithms and Combinatorics | 1987-01-01 | Paper |
Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
Acta Applicandae Mathematicae | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3898607 (Why is no real title available?) | 1985-01-01 | Paper |
The Average number of pivot steps required by the Simplex-Method is polynomial
Zeitschrift für Operations Research | 1982-01-01 | Paper |
Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
Mathematics of Operations Research | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3797487 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3720668 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3706235 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3634010 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3601415 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3648423 (Why is no real title available?) | 1977-01-01 | Paper |
