A new heuristic for rectilinear Steiner trees.
Ion I. MandoiuVijay V. VaziraniJoseph L. GanleyPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2000)
Keyphrases
- steiner tree
- minimum spanning tree
- linear programming relaxation
- facility location
- packing problem
- shortest path
- simulated annealing
- lagrangian relaxation
- dynamic programming
- linear programming
- search algorithm
- mixed integer
- weighted graph
- knapsack problem
- feasible solution
- mixed integer programming
- traveling salesman problem