The Graver complexity of integer programming (Q659795)

From MaRDI portal
Revision as of 21:24, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Graver complexity of integer programming
scientific article

    Statements

    title
    The Graver complexity of integer programming (English)
    0 references
    author
    Yael Berstein
    0 references
    Shmuel Onn
    0 references
    publication date
    24 January 2012
    0 references
    Mathematics Subject Classification ID
    90C10
    0 references
    13P10
    0 references
    05C50
    0 references
    zbMATH DE Number
    5999908
    0 references
    zbMATH Keywords
    Graver basis
    0 references
    Gröbner basis
    0 references
    Graver complexity
    0 references
    Markov complexity
    0 references
    contingencytable
    0 references
    transportation polytope
    0 references
    transportation problem
    0 references
    integer programming
    0 references
    computational complexity
    0 references
    OpenAlex ID
    W2078515884
    0 references
    arXiv ID
    0709.1500
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q659795&oldid=35263481"
    Powered by MediaWiki