Minimax regret spanning arborescences under uncertain costs (Q881514): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:48, 30 January 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
