A Hybrid Technique for Discrete Gate Sizing Based on Lagrangian Relaxation.
Vinicius S. LivramentoChrystian GuthJosé Luís Almada GüntzelMarcelo O. JohannPublished in: ACM Trans. Design Autom. Electr. Syst. (2014)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- dual decomposition
- lower bound
- branch and bound algorithm
- column generation
- dynamic programming
- np hard
- linear programming
- lower and upper bounds
- mixed integer programming
- capacity constraints
- shortest path
- mixed integer program
- network design problem
- subgradient method
- mixed integer linear programs
- optimal solution
- lagrangian dual
- single machine scheduling problem
- convex hull
- upper bound
- learning algorithm
- neural network