Nearly Optimal Solution for Restricted Euclidean Bottleneck Steiner Tree Problem.
Zimao LiWenying XiaoPublished in: J. Networks (2014)
Keyphrases
- optimal solution
- steiner tree
- solution quality
- prize collecting
- linear programming
- np hard
- facility location
- euclidean distance
- iterative procedure
- feasible solution
- global optimum
- euclidean space
- search space
- column generation
- total cost
- half spaces
- euclidean metric
- knapsack problem
- working set
- linear program
- objective function
- data sets
- database
- branch and bound
- mixed integer
- metaheuristic
- linear programming problems
- response time
- multi objective
- lower bound
- multicast routing