Models and heuristics for a minimum arborescence problem (Q5433191)
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 5224054
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Models and heuristics for a minimum arborescence problem |
scientific article; zbMATH DE number 5224054 |
Statements
Models and heuristics for a minimum arborescence problem (English)
0 references
8 January 2008
0 references
arborescence
0 references
Steiner tree
0 references
reformulation
0 references
connectivity constraints
0 references
Lagrangean relaxation
0 references
local search
0 references
0.8237012624740601
0 references
0.811900794506073
0 references
0.8008658289909363
0 references
0.7994213700294495
0 references
0.7882176637649536
0 references
