2014
|
Markus G?hl and Karl-Heinz Borgwardt
The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model
preprint (2014)
PDF | BibTeX | RIS
Auch erschienen in: Mathematical Methods of Operations Research, Volume 80, Issue 3 (2014),p. 329-366. DOI https://doi.org/10.1007/s00186-014-0483-8
|
Karl-Heinz Borgwardt
Wie schnell arbeitet das Simplexverfahren normalerweise? Oder: das Streben nach (stochastischer) Unabh?ngigkeit
Mitteilungen der Deutschen Mathematiker-Vereinigung 22, 80-92 (2014)
PDF | BibTeX | RIS | DOI
|
2010
|
Karl-Heinz Borgwardt
Aufgabensammlung und Klausurentrainer zur Optimierung : Für die Bachelorausbildung in mathematischen Studieng?ngen
(2010)
BibTeX | RIS | DOI
|
2009
|
Operations Research Proceedings 2008: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR) University of Augsburg, September 3-5, 2008
in: , ed. by Bernhard Fleischmann, Karl-Heinz Borgwardt, Robert Klein, Axel Tuma, (Springer: Berlin [u.a.], 2009)
BibTeX | RIS | DOI
|
2007
|
Karl-Heinz Borgwardt
Average-case analysis of the double description method and the beneath-beyond algorithm
Discrete & Computational Geometry 37, 175-204 (2007)
PDF | BibTeX | RIS | DOI
|
2004
|
Karl-Heinz Borgwardt
Die mittlere Schrittzahl beim Simplexverfahren - als vorlesbare Vereinfachung
in: , (2004)
PDF | BibTeX | RIS
|
2002
|
Petra Huhn and Karl-Heinz Borgwardt
Interior-point methods: worst case and average case analysis of a phase-I algorithm and a termination procedure
Journal of Complexity 18, 833-910 (2002)
PDF | BibTeX | RIS | DOI
|
Karl-Heinz Borgwardt
Linear programming
in: Knowledge for sustainable development: an insight into the encyclopedia of life support systems, (Environment and Development series) 283-318 (UNESCO/EOLSS: Paris, 2002)
PDF | BibTeX | RIS
Contributions to Theme 2.2 "Optimization and Operations Research"
|
2001
|
Karl-Heinz Borgwardt
Optimierung, Operations Research, Spieltheorie : mathematische Grundlagen
(Birkh?user: Basel [u.a.], 2001)
BibTeX | RIS | DOI
|
Karl-Heinz Borgwardt
Probabilistic analysis of simplex algorithms
in: Encyclopedia of optimization, ed. by Christodoulos A. Floudas, 368-379 (Kluwer: Dordrecht, 2001)
PDF | BibTeX | RIS | DOI
|
1999
|
Karl-Heinz Borgwardt and Petra Huhn
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 49, 175-210 (1999)
PDF | BibTeX | RIS | DOI
|
Karl-Heinz Borgwardt
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 24, 529-784 (1999)
PDF | BibTeX | RIS | DOI
Due to an error in typesetting, an incorrect version of Figure 1 was printed as part of this paper in Mathematics of Operations Research, Vol. 24 No. 3, August 1999, pp.
|
1998
|
Petra Huhn and Karl-Heinz Borgwardt
An upper bound for the average number of iterations required in phase II of an interior-point-method
Operations Research Proceedings 1997, 19-24 (1998)
PDF | BibTeX | RIS | DOI
|
Karl-Heinz Borgwardt
Ideas leading to a better bound on the average number of pivot steps for solving an LP
Operations Research Proceedings 1997, 1-12 (1998)
PDF | BibTeX | RIS | DOI
|
1997
|
Karl-Heinz Borgwardt
Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
Discrete & Computational Geometry 17, 79-109 (1997)
PDF | BibTeX | RIS | DOI
Auch erschienen als DFG-Schwerpunkt-Report Nr. 478, 1993, 50 Seiten
|
1994
|
Karl-Heinz Borgwardt and Jürgen Brzank
Average saving effects in enumerative methods for solving Knapsack problems
Journal of Complexity 10, 129-141 (1994)
BibTeX | RIS | DOI
|
Karl-Heinz Borgwardt
Improving the theoretical upper b |