The complexity of linear programming (Q5904897)

From MaRDI portal
Revision as of 21:45, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 3737374
Language Label Description Also known as
English
The complexity of linear programming
scientific article; zbMATH DE number 3737374

    Statements

    title
    The complexity of linear programming (English)
    0 references
    author
    Jan Telgen
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    simplex method
    0 references
    Khachiyan's algorithm
    0 references
    ellipsoid algorithm
    0 references

    Identifiers

    zbMATH DE Number
    3737374
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5904897&oldid=17597489"
    Powered by MediaWiki