Gate sizing using Lagrangian relaxation combined with a fast gradient-based pre-processing step.
Hiran TennakoonCarl SechenPublished in: ICCAD (2002)
Keyphrases
- lagrangian relaxation
- preprocessing
- lower bound
- integer programming
- linear programming
- feasible solution
- column generation
- dynamic programming
- branch and bound algorithm
- np hard
- dual decomposition
- capacity constraints
- lower and upper bounds
- network design problem
- relaxation algorithm
- lagrangian heuristic
- mixed integer program
- single machine scheduling problem
- cutting plane algorithm
- upper bound
- special case
- feature extraction
- mixed integer linear programs
- data mining