Rapid gate sizing with fewer iterations of Lagrangian Relaxation.
Ankur SharmaDavid G. ChinneryShrirang DhamdhereChris ChuPublished in: ICCAD (2017)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- lower bound
- lower and upper bounds
- linear programming
- branch and bound algorithm
- dynamic programming
- np hard
- column generation
- capacity constraints
- dual decomposition
- relaxation algorithm
- mixed integer program
- mixed integer programming
- lagrangian heuristic
- network design problem
- cutting plane algorithm
- shortest path
- set covering problem
- subgradient method
- single machine scheduling problem
- machine learning
- branch and bound
- constraint programming