Lagrangian relaxation based register placement for high-performance circuits.
Mei-Fang ChiangTakumi OkamotoTakeshi YoshimuraPublished in: ISQED (2009)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- branch and bound algorithm
- lower bound
- lower and upper bounds
- np hard
- column generation
- linear programming
- dynamic programming
- capacity constraints
- dual decomposition
- relaxation algorithm
- single machine scheduling problem
- subgradient method
- mixed integer programming
- network design problem
- shortest path
- lagrangian heuristic
- mixed integer program
- optimal solution
- branch and bound
- scheduling problem
- lagrangian dual
- upper bound
- integer program
- multi objective
- mixed integer linear programs