A branch and bound algorithm for the robust spanning tree problem with interval data (Q706974)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2132681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for the robust spanning tree problem with interval data |
scientific article; zbMATH DE number 2132681 |
Statements
A branch and bound algorithm for the robust spanning tree problem with interval data (English)
0 references
9 February 2005
0 references
Branch and bound
0 references
Robust optimization
0 references
Interval data
0 references
Spanning tree problem
0 references
0.924620807170868
0 references
0.9113982319831848
0 references
0.8415083885192871
0 references
0.8360530734062195
0 references
0.8215497732162476
0 references
