Minimax regret spanning arborescences under uncertain costs (Q881514)

From MaRDI portal
Revision as of 17:52, 6 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
Minimax regret spanning arborescences under uncertain costs
scientific article

    Statements

    Minimax regret spanning arborescences under uncertain costs (English)
    0 references
    0 references
    0 references
    30 May 2007
    0 references
    0 references
    robust optimization
    0 references
    minimum spanning arborescences
    0 references
    Edmonds' algorithm
    0 references