Fast and efficient lagrangian relaxation-based discrete gate sizing.
Vinicius S. LivramentoChrystian GuthJosé Luís GüntzelMarcelo O. JohannPublished in: DATE (2013)
Keyphrases
- lagrangian relaxation
- dynamic programming
- column generation
- lower bound
- network design problem
- branch and bound algorithm
- shortest path
- np hard
- branch and bound
- feasible solution
- reinforcement learning
- linear programming
- lower and upper bounds
- upper bound
- cutting plane algorithm
- relaxation algorithm
- dual decomposition
- lagrangian heuristic