K. Borgwardt

发表

The Simplex Method: A Probabilistic Analysis

K. Borgwardt, 1986 .

A probabilistic analysis of the simplex method

K. Borgwardt, 1986 .

A Sharp Upper Bound for the Expected Number of Shadow Vertices in Lp-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes

K. Borgwardt, 1999 .

The Simplex Method: A Probabilistic Analysis

K. Borgwardt, 1986 .

The Average number of pivot steps required by the Simplex-Method is polynomial

Karl-Heinz Borgwardt, K. Borgwardt, 1982, Z. Oper. Research.

Probabilistic analysis of optimization algorithms-some aspects from a practical point of view

K. Borgwardt, Karl Heinz Borgwardt, 1987, Acta Applicandae Mathematicae.

The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model

K. Borgwardt, Markus Göhl, 2014, Mathematical Methods of Operations Research.

Average-Case Analysis of the Double Description Method and the Beneath-Beyond Algorithm

Karl Heinz Borgwardt, K. Borgwardt, 2007, Discret. Comput. Geom..

Interior-Point Methods: Worst Case and Average Case Analysis of a Phase-I Algorithm and a Termination Procedure

Petra Huhn, Karl Heinz Borgwardt, K. Borgwardt, 2002, J. Complex..

Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method

Karl Heinz Borgwardt, K. Borgwardt, 1982, Math. Oper. Res..

Operations Research Proceedings 2008

Robert Klein, Bernhard Fleischmann, Karl Heinz Borgwardt, 2009 .