A heuristic for constructing a rectilinear Steiner tree by reusing routing resources over obstacles.

Hao Zhang Dongyi Ye Wenzhong Guo

Published in: Integr. (2016)

Keyphrases

steiner tree
minimum spanning tree
shortest path
packing problem
linear programming relaxation
dynamic programming
routing algorithm
optimal solution
routing problem
facility location
search algorithm
simulated annealing
learning objects
tabu search
routing protocol
lagrangian relaxation