Katalog der Deutschen Nationalbibliothek

Ergebnis der Suche nach: "109113217"
im Bestand: Gesamter Bestand

21 - 30 von 45

	21	Optimierung, Operations Research, Spieltheorie Borgwardt, Karl Heinz. - Basel : Birkhäuser, 2001
	22	Probabilistic analysis of simplex algorithms Borgwardt, Karl Heinz. - Augsburg : Universität Augsburg, 2001
	23	A lower bound on the average number of Pivot-steps for solving linear programs: valid for all variants of the simplex-algorithm Borgwardt, Karl Heinz. - Augsburg : Universität Augsburg, 1999
	24	A sharp upper bound for the expected number of shadow vertices in LP-polyhedra under orthogonal projection on two-dimensional planes Borgwardt, Karl Heinz. - Augsburg : Universität Augsburg, 1999
	25	A sharp upper bound for the expected number of shadow vertices in LP-polyhedra under orthogonal projection on two-dimensional planes Borgwardt, Karl Heinz. - Augsburg : Inst. für Mathematik, 1999
	26	An upper bound for the average number of iterations required in phase II of an interior-point-method Huhn, Petra. - Augsburg : Universität Augsburg, 1998
	27	Ideas leading to a better bound on the average number of pivot steps for solving an LP Borgwardt, Karl Heinz. - Augsburg : Universität Augsburg, 1998
	28	Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points Borgwardt, Karl Heinz. - Augsburg : Universität Augsburg, 1997
	29	Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points Enthalten in Discrete & computational geometry Bd. 17, Nr. 1, date:1.1997: 79-109
	30	Improving the theoretical upper bound for the expected number of shadow vertices in the rotation symmetry model Borgwardt, Karl Heinz. - Augsburg : Inst. für Mathematik, 1994