On the Complexity of Selecting Disjunctions in Integer Programming (Q3083283)

From MaRDI portal
Revision as of 20:56, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the Complexity of Selecting Disjunctions in Integer Programming
scientific article

    Statements

    title
    On the Complexity of Selecting Disjunctions in Integer Programming (English)
    0 references
    author
    Ashutosh Mahajan
    0 references
    Ted K. Ralphs
    0 references
    publication date
    21 March 2011
    0 references
    zbMATH Keywords
    complexity
    0 references
    disjunctions
    0 references
    general branching
    0 references
    split inequalities
    0 references
    integer programming
    0 references

    Identifiers

    DOI
    10.1137/080737587
    0 references
    Mathematics Subject Classification ID
    90C10
    0 references
    68Q25
    0 references
    90C57
    0 references
    zbMATH DE Number
    5868691
    0 references
    OpenAlex ID
    W2158102350
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3083283&oldid=31863612"
    Powered by MediaWiki