An adaptation of the interior point method for solving the global routing problem.
Anthony VannelliPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1991)
Keyphrases
- routing problem
- interior point methods
- linear programming problems
- interior point algorithm
- quadratic programming
- convex optimization
- solving problems
- linear programming
- primal dual
- vehicle routing problem
- linear program
- combinatorial optimization
- traveling salesman problem
- shortest path
- semidefinite programming
- coefficient matrix
- global optimization
- travel time
- set partitioning
- routing algorithm
- column generation
- image processing
- end to end
- upper bound
- lower bound