Complexity of linear programming (Q1165154)

From MaRDI portal
Revision as of 10:08, 25 September 2024 by CorrectionBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of linear programming
scientific article

    Statements

    title
    Complexity of linear programming (English)
    0 references
    author
    J. F. Traub
    0 references
    Henryk Woźniakowski
    0 references
    publication date
    1982
    0 references
    zbMATH Keywords
    complexity of linear programming
    0 references
    real number models
    0 references
    integer model
    0 references
    ellipsoid algorithm
    0 references
    polynomial-time algorithm
    0 references
    linear inequalities
    0 references
    models of computation
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C05
    0 references
    68Q25
    0 references
    65F10
    0 references
    15A39
    0 references
    zbMATH DE Number
    3765536
    0 references
    OpenAlex ID
    W2159092483
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1165154&oldid=37848289"
    Powered by MediaWiki