Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065)

From MaRDI portal
Revision as of 14:30, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
scientific article

    Statements

    Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 February 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    global optimization
    0 references
    probabilistic analysis
    0 references
    average number of steps
    0 references
    parametric simplex algorithms
    0 references
    bilinear-programming
    0 references
    0 references
    0 references
    0 references