default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarl Heinz Borgwardt
Person information
- affiliation: University of Augsburg, Institute for Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j11]Markus Göhl, Karl Heinz Borgwardt:
The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model. Math. Methods Oper. Res. 80(3): 329-366 (2014)- 2007
- [j10]Karl Heinz Borgwardt:
Average-Case Analysis of the Double Description Method and the Beneath-Beyond Algorithm. Discret. Comput. Geom. 37(2): 175-204 (2007) - 2002
- [j9]Petra Huhn, Karl Heinz Borgwardt:
Interior-Point Methods: Worst Case and Average Case Analysis of a Phase-I Algorithm and a Termination Procedure. J. Complex. 18(3): 833-910 (2002) - 1999
- [j8]Karl Heinz Borgwardt, Petra Huhn:
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. 49(2): 175-210 (1999) - 1997
- [j7]Karl Heinz Borgwardt:
Average Complexity of a Gift-Wrapping Algorithm for Determining the Convex Hull of Randomly Given Points. Discret. Comput. Geom. 17(1): 79-109 (1997) - 1996
- [j6]Reiner Horst, Karl Heinz Borgwardt:
Book reviews. Math. Methods Oper. Res. 44(2): 291-293 (1996) - 1994
- [j5]Karl Heinz Borgwardt, Jürgen Brzank:
Average Saving Effects in Enumerative Methods for Solving Knapsack Problems. J. Complex. 10(1): 129-141 (1994) - 1993
- [j4]Karl Heinz Borgwardt, Renate Damm, Rudolf Donig, Gabriele Joas:
Empirical Studies on the Average Efficiency of Simplex Variants under Rotation Symmetry. INFORMS J. Comput. 5(3): 249-260 (1993) - 1991
- [j3]Karl Heinz Borgwardt, Birgit Tremel:
The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem. ZOR Methods Model. Oper. Res. 35(2): 113-149 (1991) - 1982
- [j2]Karl-Heinz Borgwardt:
The Average number of pivot steps required by the Simplex-Method is polynomial. Z. Oper. Research 26(1): 157-177 (1982) - [j1]Karl Heinz Borgwardt:
Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method. Math. Oper. Res. 7(3): 441-462 (1982)
Conference and Workshop Papers
- 1990
- [c1]Karl Heinz Borgwardt, Norbert Gaffke, Michael Jünger, Gerhard Reinelt:
Computing the Convex Hull in the Euclidean Plane in Linear Expected Time. Applied Geometry And Discrete Mathematics 1990: 91-108
Reference Works
- 2009
- [r1]Karl Heinz Borgwardt:
Probabilistic Analysis of Simplex Algorithms. Encyclopedia of Optimization 2009: 3073-3084
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
