Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933)

From MaRDI portal
Revision as of 19:10, 10 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Min-max and min-max regret versions of combinatorial optimization problems: A survey
scientific article

    Statements

    Min-max and min-max regret versions of combinatorial optimization problems: A survey (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2009
    0 references
    min-max
    0 references
    min-max regret
    0 references
    combinatorial optimization
    0 references
    complexity
    0 references
    approximation
    0 references
    robustness
    0 references

    Identifiers