Lagrangian relaxation-based Discrete Gate Sizing for leakage power minimization.
Vinicius dos S. LivramentoChrystian GuthJosé Luís GüntzelMarcelo O. JohannPublished in: ICECS (2012)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- branch and bound algorithm
- lower bound
- np hard
- power losses
- lower and upper bounds
- dynamic programming
- objective function
- linear programming
- column generation
- dual decomposition
- power consumption
- lagrangian heuristic
- capacity constraints
- relaxation algorithm
- upper bound
- subgradient method
- optimal solution
- single machine scheduling problem
- knapsack problem
- leakage current
- mixed integer linear programs
- neural network
- unit commitment
- data streams
- scheduling problem
- energy minimization
- branch and bound