Design Optimization by Fine-grained Interleaving of Local Netlist Transformations in Lagrangian Relaxation.
Apostolos StefanidisDimitrios MangirasChrysostomos NicopoulosDavid G. ChinneryGiorgos DimitrakopoulosPublished in: ISPD (2020)
Keyphrases
- fine grained
- lagrangian relaxation
- integer programming
- coarse grained
- dynamic programming
- column generation
- lower bound
- branch and bound algorithm
- feasible solution
- lower and upper bounds
- linear programming
- np hard
- dual decomposition
- access control
- relaxation algorithm
- lagrangian heuristic
- shortest path
- cutting plane algorithm
- subgradient method
- data lineage
- image segmentation
- branch and bound
- convex hull
- cutting plane
- upper bound
- optimal solution
- dual variables
- lagrangian dual