A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM (Q3526525)
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 5346912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM |
scientific article; zbMATH DE number 5346912 |
Statements
A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM (English)
0 references
25 September 2008
0 references
node weighted Steiner tree problem
0 references
knapsack constraint
0 references
relax and cut algorithm
0 references
0 references
0.8501266241073608
0 references
0.8138942718505859
0 references
0.8096615076065063
0 references
0.7880390882492065
0 references
0.7879413366317749
0 references
