On the complexity of minmax regret linear programming (Q1887882)

From MaRDI portal
Revision as of 20:59, 28 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
On the complexity of minmax regret linear programming
scientific article

    Statements

    On the complexity of minmax regret linear programming (English)
    0 references
    0 references
    0 references
    22 November 2004
    0 references
    Combinatorial optimization
    0 references
    Complexity theory
    0 references
    Uncertainty modeling
    0 references
    Minmax regret optimization
    0 references

    Identifiers