Minimax regret spanning arborescences under uncertain costs (Q881514): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2006.07.036 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091418817 / rank | |||
Normal rank | |||
Revision as of 23:23, 19 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
30 May 2007
0 references
robust optimization
0 references
minimum spanning arborescences
0 references
Edmonds' algorithm
0 references
