A dual ascent approach for steiner tree problems on a directed graph (Q3315294): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02612335 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020586530 / rank | |||
Normal rank | |||
Latest revision as of 11:04, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dual ascent approach for steiner tree problems on a directed graph |
scientific article |
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 references
