Minimax regret spanning arborescences under uncertain costs (Q881514): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q228561 |
||
Property / author | |||
Property / author: Eduardo Conde / rank | |||
Revision as of 07:51, 11 February 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
30 May 2007
0 references
robust optimization
0 references
minimum spanning arborescences
0 references
Edmonds' algorithm
0 references