Výsledky vyhledávání - "average-case complexity of algorithms"

  • Zobrazuji výsledky 1 - 3 z 3
Upřesnit hledání
  1. 1

    Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions Autor Huhn, Petra, Wehlitz, Verena

    ISSN: 0377-2217, 1872-6860
    Vydáno: Amsterdam Elsevier B.V 16.04.2009
    “…To solve linear programming problems by interior point methods an approximately centered interior point has to be known. Such a point can be found by an…”
    Získat plný text
    Journal Article
  2. 2

    A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes Autor Borgwardt, Karl Heinz

    ISSN: 0364-765X, 1526-5471
    Vydáno: Linthicum INFORMS 01.08.1999
    Vydáno v Mathematics of operations research (01.08.1999)
    “…Consider a set { a 1 , ..., a m , u , v } n satisfying a mild nondegeneracy condition. When the polyhedron X = { x | a 1 T x 1, ..., a m T x 1} n is…”
    Získat plný text
    Journal Article
  3. 3

    Erratum: A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes Autor Borgwardt, Karl Heinz

    ISSN: 0364-765X, 1526-5471
    Vydáno: Linthicum INFORMS 01.11.1999
    Vydáno v Mathematics of operations research (01.11.1999)
    “…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,…”
    Získat plný text
    Journal Article