A branch and bound algorithm for the minimax regret spanning arborescence (Q878227)
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 5146239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for the minimax regret spanning arborescence |
scientific article; zbMATH DE number 5146239 |
Statements
A branch and bound algorithm for the minimax regret spanning arborescence (English)
0 references
26 April 2007
0 references
Spanning arborescences
0 references
Robust optimization
0 references
Branch and Bound algorithms
0 references
0 references
0.93495911359787
0 references
0.8250814080238342
0 references
0.8070266842842102
0 references
0.7780737280845642
0 references
