Minimax regret spanning arborescences under uncertain costs (Q881514)

From MaRDI portal
Revision as of 06:51, 11 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
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
    robust optimization
    0 references
    minimum spanning arborescences
    0 references
    Edmonds' algorithm
    0 references

    Identifiers