Minimax regret spanning arborescences under uncertain costs (Q881514): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2006.07.036 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2006.07.036 / rank | |||
Normal rank | |||
Latest revision as of 06:49, 10 December 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
0 references
0 references
0 references
0 references
0 references
0 references
