Asynchronous circuit placement by lagrangian relaxation.
Gang WuTao LinHsin-Ho HuangChris ChuPeter A. BeerelPublished in: ICCAD (2014)
Keyphrases
- lagrangian relaxation
- delay insensitive
- integer programming
- feasible solution
- lower bound
- branch and bound algorithm
- linear programming
- column generation
- np hard
- shift register
- capacity constraints
- dual decomposition
- dynamic programming
- mixed integer programming
- lower and upper bounds
- relaxation algorithm
- single machine scheduling problem
- network design problem
- mixed integer linear programs
- lagrangian heuristic
- valid inequalities
- shortest path
- subgradient method
- integer program
- mixed integer program
- branch and bound
- tabu search
- np complete
- upper bound
- search algorithm
- optimal solution