Combining evolution strategies with Lagrangian relaxation for constructing nonslicing VLSI floorplans with soft modules.
Malgorzata Chrzanowska-JeskeGarrison W. GreenwoodBenyi WangPublished in: IEEE Congress on Evolutionary Computation (2002)
Keyphrases
- lagrangian relaxation
- evolution strategy
- integer programming
- evolutionary algorithm
- lower bound
- feasible solution
- np hard
- column generation
- linear programming
- lower and upper bounds
- branch and bound algorithm
- dynamic programming
- dual decomposition
- lagrangian heuristic
- mixed integer programming
- differential evolution
- relaxation algorithm
- shortest path
- mixed integer linear programs
- subgradient method
- learning algorithm
- genetic algorithm
- optimization methods
- global search
- particle swarm optimization algorithm
- simulated annealing
- upper bound