The recoverable robust spanning tree problem with interval costs is polynomially solvable (Q2361123)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The recoverable robust spanning tree problem with interval costs is polynomially solvable |
scientific article |
Statements
The recoverable robust spanning tree problem with interval costs is polynomially solvable (English)
0 references
29 June 2017
0 references
robust optimization
0 references
interval data
0 references
spanning tree
0 references
matroids
0 references
0 references
