A novel ultra-fast heuristic for VLSI CAD steiner trees.
Bharat KrishnaC. Y. Roger ChenNaresh SehgalPublished in: ACM Great Lakes Symposium on VLSI (2003)
Keyphrases
- steiner tree
- minimum spanning tree
- linear programming relaxation
- dynamic programming
- search algorithm
- facility location
- shortest path
- packing problem
- optimal solution
- constraint satisfaction
- spanning tree
- lower bound
- optimization problems
- linear programming
- tabu search
- combinatorial optimization
- lower and upper bounds
- lagrangian relaxation
- simulated annealing
- mixed integer programming
- upper bound