Timing-driven routing for FPGAs based on Lagrangian relaxation.
Seokjin LeeMartin D. F. WongPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2003)
Keyphrases
- lagrangian relaxation
- shortest path
- integer programming
- feasible solution
- lower bound
- column generation
- branch and bound algorithm
- linear programming
- dual decomposition
- lower and upper bounds
- dynamic programming
- np hard
- lagrangian heuristic
- capacity constraints
- network design problem
- mixed integer program
- field programmable gate array
- single machine scheduling problem
- routing problem
- routing protocol
- routing algorithm
- relaxation algorithm
- hardware implementation
- optimal solution
- linear program
- upper bound
- valid inequalities
- combinatorial optimization
- constraint programming
- cutting plane algorithm
- mixed integer linear programs
- subgradient method