Gate Sizing by Lagrangian Relaxation Revisited.
Jia WangDebasish DasHai ZhouPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2009)
Keyphrases
- lagrangian relaxation
- integer programming
- lower bound
- feasible solution
- branch and bound algorithm
- lower and upper bounds
- column generation
- linear programming
- np hard
- dynamic programming
- dual decomposition
- mixed integer programming
- network design problem
- subgradient method
- relaxation algorithm
- capacity constraints
- mixed integer program
- lagrangian heuristic
- upper bound
- shortest path
- single machine scheduling problem
- valid inequalities
- branch and bound
- linear program
- objective function
- evolutionary algorithm
- cutting plane algorithm
- high dimensional
- constraint satisfaction problems