Minmax regret linear resource allocation problems. (Q1417598)

From MaRDI portal
Revision as of 13:34, 6 June 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
Minmax regret linear resource allocation problems.
scientific article

    Statements

    title
    Minmax regret linear resource allocation problems. (English)
    0 references
    author
    Igor Averbakh
    0 references
    publication date
    5 January 2004
    0 references
    zbMATH DE Number
    2021248
    0 references
    zbMATH Keywords
    Polynomial algorithm
    0 references
    Complexity
    0 references
    Minmax regret optimization
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1417598&oldid=34354802"
    Powered by MediaWiki