Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances.

Stephan Sloth Lorenzen Pawel Winter

Published in: SEA (2016)

Keyphrases

steiner tree
minimum spanning tree
euclidean distance
linear programming relaxation
shortest path
higher dimensional
geodesic distance

euclidean space
optimal solution
vector space
simulated annealing
dynamic programming
special case

genetic algorithm
random walk
metaheuristic
tabu search
low dimensional
constraint satisfaction

combinatorial optimization
feasible solution
evolutionary algorithm
lower bound
search algorithm
facility location