Finding total unimodularity in optimization problems solved by linear programs (Q627545)

From MaRDI portal
Revision as of 23:03, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding total unimodularity in optimization problems solved by linear programs
scientific article

    Statements

    title
    Finding total unimodularity in optimization problems solved by linear programs (English)
    0 references
    author
    Christoph Dürr
    0 references
    Mathilde Hurand
    0 references
    published in
    Algorithmica
    0 references
    publication date
    2 March 2011
    0 references
    zbMATH Keywords
    scheduling
    0 references
    caching
    0 references
    linear programming
    0 references
    totally unimodular matrices
    0 references

    Identifiers

    zbMATH DE Number
    5859356
    0 references
    OpenAlex ID
    W2569504991
    0 references
    arXiv ID
    cs/0602016
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q627545&oldid=38423303"
    Powered by MediaWiki