Karl Heinz Borgwardt

According to our database1, Karl Heinz Borgwardt authored at least 13 papers between 1982 and 2014.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model.
Math. Methods Oper. Res., 2014

2009
Probabilistic Analysis of Simplex Algorithms.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2007
Average-Case Analysis of the Double Description Method and the Beneath-Beyond Algorithm.
Discret. Comput. Geom., 2007

2002
Interior-Point Methods: Worst Case and Average Case Analysis of a Phase-I Algorithm and a Termination Procedure.
J. Complex., 2002

1999
A lower bound on the average number of Pivot-steps for solving linear programs Valid for all variants of the Simplex-Algorithm.
Math. Methods Oper. Res., 1999

1997
Average Complexity of a Gift-Wrapping Algorithm for Determining the Convex Hull of Randomly Given Points.
Discret. Comput. Geom., 1997

1996
Book reviews.
Math. Methods Oper. Res., 1996

1994
Average Saving Effects in Enumerative Methods for Solving Knapsack Problems.
J. Complex., 1994

1993
Empirical Studies on the Average Efficiency of Simplex Variants under Rotation Symmetry.
INFORMS J. Comput., 1993

1991
The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem.
ZOR Methods Model. Oper. Res., 1991

1990
Computing the Convex Hull in the Euclidean Plane in Linear Expected Time.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1982
Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method.
Math. Oper. Res., 1982

The Average number of pivot steps required by the Simplex-Method is polynomial.
Z. Oper. Research, 1982


  Loading...