A strong lower bound for the Node Weighted Steiner Tree Problem (Q4378524)
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 1124475
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strong lower bound for the Node Weighted Steiner Tree Problem |
scientific article; zbMATH DE number 1124475 |
Statements
5 March 1998
0 references
prize-collecting
0 references
Lagrangean relaxation
0 references
subgradient optimizatoin
0 references
node weighted Steiner tree problem
0 references
Steiner tree problem
0 references
undirected graph
0 references
A strong lower bound for the Node Weighted Steiner Tree Problem (English)
0 references
0.9025669693946838
0 references
0.8941792845726013
0 references
0.8528979420661926
0 references
0.8183414340019226
0 references
