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 this page instead for the normal view: A branch and bound algorithm for the minimax regret spanning arborescence |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the minimax regret spanning arborescence |
scientific article |
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
