A strong lower bound for the Node Weighted Steiner Tree Problem.
Stefan EngevallMaud Göthe-LundgrenPeter VärbrandPublished in: Networks (1998)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- worst case
- objective function
- optimal solution
- branch and bound
- np hard
- lower and upper bounds
- prize collecting
- xml documents
- weighted sum
- lower bounding
- multicast routing
- genetic algorithm
- decision trees
- edge weights
- linear programming relaxation
- sufficiently accurate
- delay constrained