Gate sizing by Lagrangian relaxation revisited.
Jia WangDebasish DasHai ZhouPublished in: ICCAD (2007)
Keyphrases
- lagrangian relaxation
- integer programming
- lower bound
- branch and bound algorithm
- feasible solution
- column generation
- dynamic programming
- lower and upper bounds
- np hard
- linear programming
- capacity constraints
- mixed integer programming
- dual decomposition
- relaxation algorithm
- network design problem
- single machine scheduling problem
- subgradient method
- lagrangian heuristic
- shortest path
- upper bound
- cost function
- mathematical model
- cutting plane algorithm
- combinatorial optimization
- linear program
- set covering problem
- simulated annealing
- special case