Minimax regret spanning arborescences under uncertain costs (Q881514)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimax regret spanning arborescences under uncertain costs |
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
