Minimax regret spanning arborescences under uncertain costs (Q881514): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:29, 5 March 2024

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