Fast and Near-Optimal Timing-Driven Cell Sizing under Cell Area and Leakage Power Constraints Using a Simplified Discrete Network Flow Algorithm.
Huan RenShantanu DuttPublished in: VLSI Design (2013)
Keyphrases
- network flow
- learning algorithm
- optimal solution
- optimization algorithm
- combinatorial optimization
- segmentation algorithm
- np hard
- simulated annealing
- linear programming
- dynamic programming
- integer programming
- integer program
- particle swarm optimization
- worst case
- bipartite graph
- minimum cost
- optimization model
- lower and upper bounds
- evolutionary algorithm