On the complexity of the robust spanning tree problem with interval data (Q1433657)
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: On the complexity of the robust spanning tree problem with interval data |
scientific article; zbMATH DE number 2077343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the robust spanning tree problem with interval data |
scientific article; zbMATH DE number 2077343 |
Statements
On the complexity of the robust spanning tree problem with interval data (English)
0 references
1 July 2004
0 references
Robust spanning tree
0 references
Robust optimization
0 references
Uncertainty
0 references
Interval data
0 references
0.8375301957130432
0 references
0.8054049611091614
0 references
0.7956965565681458
0 references
0.7850245237350464
0 references
0.7821199893951416
0 references
