Minmax regret linear resource allocation problems. (Q1417598)

From MaRDI portal
Revision as of 18:19, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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=13586576"
    Powered by MediaWiki