An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926)

From MaRDI portal
Revision as of 08:18, 2 July 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
An approximation algorithm for interval data minmax regret combinatorial optimization problems
scientific article

    Statements

    An approximation algorithm for interval data minmax regret combinatorial optimization problems (English)
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    robust optimization
    0 references
    maximal regret
    0 references
    approximation algorithms
    0 references
    combinatorial optimization
    0 references
    0 references