On the complexity of cutting-plane proofs using split cuts (Q969513)

From MaRDI portal
Revision as of 20:36, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
On the complexity of cutting-plane proofs using split cuts
scientific article

    Statements

    title
    On the complexity of cutting-plane proofs using split cuts (English)
    0 references
    author
    Sanjeeb Dash
    0 references
    publication date
    7 May 2010
    0 references
    Mathematics Subject Classification ID
    90C11
    0 references
    90C60
    0 references
    90C10
    0 references
    90C57
    0 references
    zbMATH DE Number
    5705343
    0 references
    zbMATH Keywords
    cutting-plane proof
    0 references
    split cut
    0 references
    mixed-integer rounding
    0 references
    monotone interpolation
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q969513&oldid=12955593"
    Powered by MediaWiki