A dual ascent approach for steiner tree problems on a directed graph (Q3315294)
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 3845368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dual ascent approach for steiner tree problems on a directed graph |
scientific article; zbMATH DE number 3845368 |
Statements
A dual ascent approach for steiner tree problems on a directed graph (English)
0 references
1984
0 references
computational results
0 references
Steiner tree problem
0 references
directed graph
0 references
directed subtree
0 references
dual ascent procedure
0 references
lower bounds to the optimal solution value
0 references
heuristic procedure
0 references
directed spanning tree
0 references
uncapacitated plant location
0 references
0 references
0.8424196839332581
0 references
0.8346877098083496
0 references
0.8068189024925232
0 references
0.8050946593284607
0 references
