Solving the Rectilinear Steiner Minimal Tree Problem with a Branch and Cut Algorithm.
Nahit EmanetCan C. ÖzturanPublished in: Int. J. Comput. (2004)
Keyphrases
- learning algorithm
- minimum spanning tree
- computational complexity
- preprocessing
- tree structure
- optimization algorithm
- matching algorithm
- times faster
- experimental evaluation
- objective function
- clustering method
- detection algorithm
- expectation maximization
- simulated annealing
- convergence rate
- recognition algorithm
- computational cost
- dynamic programming
- cost function
- search space
- combinatorial optimization
- d mesh
- backtracking algorithm
- quadratic optimization problems
- shortest path
- linear programming
- high accuracy
- worst case
- scheduling problem
- significant improvement
- k means
- search algorithm