Timing-driven routing for FPGAs based on Lagrangian relaxation.
Seokjin LeeD. F. WongPublished in: ISPD (2002)
Keyphrases
- lagrangian relaxation
- shortest path
- integer programming
- feasible solution
- lower bound
- lower and upper bounds
- np hard
- branch and bound algorithm
- column generation
- linear programming
- routing algorithm
- dynamic programming
- capacity constraints
- dual decomposition
- relaxation algorithm
- lagrangian heuristic
- routing problem
- single machine scheduling problem
- network design problem
- mixed integer program
- hardware implementation
- scheduling problem
- search algorithm