Tackling the Drawbacks of a Lagrangian Relaxation Based Discrete Gate Sizing Algorithm.
Henrique PlacidoRicardo ReisPublished in: ISVLSI (2019)
Keyphrases
- lagrangian relaxation
- dynamic programming
- learning algorithm
- np hard
- search space
- linear programming
- cost function
- objective function
- lower and upper bounds
- branch and bound algorithm
- simulated annealing
- denoising
- particle swarm optimization
- np complete
- integer programming
- optimal solution
- mixed integer programming
- relaxation algorithm
- dual decomposition