A new exact algorithm for rectilinear Steiner trees.
David M. WarmePublished in: Network Design: Connectivity and Facilities Location (1997)
Keyphrases
- computational complexity
- convex hull
- dynamic programming
- probabilistic model
- arbitrary shaped
- convergence rate
- linear programming
- cost function
- simulated annealing
- np hard
- segmentation algorithm
- mathematical model
- evolutionary algorithm
- knapsack problem
- lower and upper bounds
- minimum spanning tree
- steiner tree
- optimal solution