The Simplex Algorithm Is NP-Mighty (Q4629975)

From MaRDI portal
Revision as of 16:07, 2 May 2024 by EloiFerrer (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
No description defined
Language Label Description Also known as
English
The Simplex Algorithm Is NP-Mighty
No description defined

    Statements

    title
    The Simplex Algorithm Is NP-Mighty (English)
    0 references
    DOI
    10.1145/3280847
    0 references
    author
    Yann Disser
    0 references
    Martin Skutella
    0 references
    publication date
    28 March 2019
    0 references
    Mathematics Subject Classification ID
    90C05
    0 references
    68Q17
    0 references
    90C49
    0 references
    90C60
    0 references
    zbMATH DE Number
    7044609
    0 references
    zbMATH Keywords
    NP-mightiness
    0 references
    simplex algorithm
    0 references
    earliest arrival flows
    0 references
    network simplex
    0 references
    successive shortest paths
    0 references
    Wikidata QID
    Q60358029
    0 references
    OpenAlex ID
    W2996397717
    0 references
    arXiv ID
    1311.5935
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4629975&oldid=34061824"
    Powered by MediaWiki