Lagrangian relaxation based pin assignment and Through-Silicon Via planning for 3-D SoCs.
Wei ZhongSong ChenYang GengTakeshi YoshimuraPublished in: ASICON (2013)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- lower bound
- branch and bound algorithm
- dynamic programming
- dual decomposition
- lower and upper bounds
- column generation
- linear programming
- lagrangian heuristic
- np hard
- capacity constraints
- network design problem
- production planning
- relaxation algorithm
- mixed integer program
- mixed integer programming
- single machine scheduling problem
- cutting plane algorithm
- heuristic search
- upper bound
- mixed integer linear programs
- linear program
- branch and bound
- scheduling problem
- valid inequalities
- neural network
- shortest path
- multi objective